Inventors list |
Assignees list |
Classification tree browser |
Top 100 Inventors |
Top 100 Assignees |
Kedia
Monu Kedia, Jharkhand IN
| Patent application number | Description | Published |
|---|---|---|
| 20100094870 | METHOD FOR MASSIVELY PARALLEL MULTI-CORE TEXT INDEXING - There is provided, in a parallel pipelined structure on a multi-core device, a method for parallel pipelined multi-core indexing. The method includes generating one or more single document indexes respectively corresponding to one or more single documents of a given data stream. The method further includes generating one or more multi-document interval-based hash tables from the one or more single document indexes. The method also includes generating a global hash table formed from merging one or more of the multi-document interval-based hash tables, the global hash table representing a collective index for all of the single documents for which the one or more single document indexes were generated. | 04-15-2010 |
| 20110293193 | Spatio-Temporal Image Reconstruction Using Sparse Regression and Secondary Information - A spatio-temporal image of an object is reconstructed based on captured data characterizing the object. The spatio-temporal image comprises a plurality of spatial images in respective time intervals, and at least a given one of the spatial images in one of the time intervals is reconstructed using not only captured data from a frame associated with that time interval but also captured data associated with one or more additional frames associated with other time intervals. The spatio-temporal image may be reconstructed by iteratively obtaining a solution to a minimization or maximization problem in a sparse domain and transforming the solution to an image domain. The transformation between the sparse domain and the image domain may utilize a spatio-temporal transformation implemented using a plurality of basis functions, one or more of which may be determined at least in part based on secondary information associated with the imaged object. | 12-01-2011 |
Pankaj Kedia, Palo Alto, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20090276330 | Low-Power Subsystem for Portable Computers - A low power subsystem for a portable computer is described. In one example, the portable computer includes a computer system and low power multimedia center. The computer system includes a central processing unit, a system memory, a mass storage device, and a user interface, the computer system having a low-power mode in which the CPU, system memory, and user interface are inactive. The low-power multimedia center includes a low power processor coupled to the mass storage device, a low power memory coupled to the low power processor, a miniature display to display multimedia from the mass storage device, and an external user interface coupled to the processor, independent of the computer system to control the displaying of multimedia. | 11-05-2009 |
Ridhima Kedia, Kolkata IN
| Patent application number | Description | Published |
|---|---|---|
| 20090089169 | Event Based Serving - Apparatus, system and methods for an event based advertising server are enclosed. Trend data measured over time periods for user queries are measured. A determination is made as to whether an eligibility event for an advertisement has occurred. If an eligibility event is determined to have occurred, eligibility change data for the advertisement is generated. The eligibility change data defines a change to the presentation eligibility of the advertisement and is based on the trend data. | 04-02-2009 |
Rishika Kedia, Bangalore IN
| Patent application number | Description | Published |
|---|---|---|
| 20120102187 | Storage Workload Balancing - Storage workload balancing in a data processing environment is provided by detecting automatically overloaded storage providers and automatically transferring storage subsystems from overloaded storage providers to storage providers with available capacity. This automatic workload balancing prevents some storage providers experiencing reduced performance while other available storage providers have unused excess capacity. If all of the available storage providers are overloaded, a new storage provider may be added automatically to a server and operating system instance that is best able to handle extra work. | 04-26-2012 |
| 20120102290 | Storage Scalability Management - Storage scalability management is provided by adding storage in a data processing environment. A new storage subsystem is added automatically to an available storage provider only if doing so will not reduce the performance of the storage provider to an unacceptable level. If no such storage provider is available, a new storage provider is added automatically. The new storage provider is added automatically to the server and operating system that is best able to handle the additional work. Thus, a new storage subsystem is added automatically in a data processing environment in a manner that provides for system scalability while minimizing any adverse impact on system performance. | 04-26-2012 |
Rohit Kedia, Muzaffarnagar IN
| Patent application number | Description | Published |
|---|---|---|
| 20110314449 | METHOD AND SYSTEM FOR ESTIMATING EFFORT FOR MAINTENANCE OF SOFTWARE - The present invention provides a method, a system, and a computer program product for determining an effort associated with the maintenance of software. The method, the system, and the computer program product enable receiving values corresponding to predefined factors, which are segregated into corrective factors, preventive factors, perfective factors, and adaptive factors. A corrective effort is determined based on the corrective factors and predefined rules. Thereafter, a preventive effort is determined based on the preventive factors, the predefined rules, and the corrective effort. Thereafter, a perfective effort is determined based on the perfective factors, the predefined rules, and the corrective effort. Subsequently, an adaptive effort is determined based on the adaptive factors, the predefined rules, the corrective effort, the preventive effort, and the perfective effort. A total effort is then generated based on the corrective effort, the preventive effort, the perfective effort, and the adaptive effort. | 12-22-2011 |
Vikas Kedia, Kondapur IN
| Patent application number | Description | Published |
|---|---|---|
| 20100036690 | SERVICE SCHEDULING - Techniques for scheduling one or more services are provided. The techniques include obtaining customer information, obtaining one or more service characteristics for each of the one or more services, and using the customer information and the one or more service characteristics to schedule the one or more services. | 02-11-2010 |