1310results about How to "Efficient search" patented technology

A method and apparatus for conducting a pilot signal search in a wireless communications network. The location of a mobile is determined within the network. This location is then used in determining search window sizes and other search parameter information that is used to search all pilot signals identified in a designated pilot signal set. Search window size is also determined based upon the location of the mobile and another component related to multipath effects for a transmitted pilot signal.

A system and method for a search engine is disclosed. A method for operating a search engine may include calculating a plurality of document vectors, receiving a search request, calculating a search request vector, calculating a distance between the search request vector and the plurality of document vectors, and returning a list of documents that are within a predetermined distance of the search request vector. An information handling system for a search engine may include a central processing unit that is coupled to a general purpose graphical processing unit. The central processing unit is able to calculate a plurality of document vectors, receive a search request, calculate a search vector, and return a list of documents that are within a predetermined distance of the search request vector. The general purpose graphical processing unit is able to calculate a distance between the search request vector and the plurality of document vectors.

Concept searching using a Boolean or keyword search engine. Documents are preprocessed before being passed to a search engine by identifying, on a word-by-word basis, the "word tokens" contained in the document. Once the word tokens have been extracted, each word token is referenced in a concept database that maps word tokens to concept identifiers. The concept identifiers associated with the word tokens are converted into unique non-word concept tokens and arranged into a list. The list is then inserted into the document as invisible but searchable text. The document is then transferred to the server monitored by the search engine. Search queries are preprocessed before being passed to the search engine in the same manner. The query is first broken into word tokens and the word tokens are then referenced in the concept database. All associated concept identifiers are retrieved and converted to unique concept tokens. The concept tokens are then combined into a string and sent to the search engine as an ordinary query.

The present invention provides a data-structure to store a search database and provides techniques to build this datastructure given a list of prefixes (P) and to search this database efficiently for a best matching prefix for an address D. The data-structure can be stored in standard memory (14), where values are stored associated with memory address locations. The data structure includes representations of addressable linked tables (FIG. 3b). The representations are related to a binary search trie (FIG. 1) and each linked table (T) has at least one entry. Entries in a table span more than one level of the binary search trie. The spanning feature relates to compression of a binary search trie into a finite number of levels (and hence tables). The finite number is less than the number of levels in the binary search trie. Hence the search algorithm is restricted to a finite, and predetermined number of search accesses to the tables to obtain a best-match result.

An audio fingerprint is extracted from an audio sample, where the fingerprint contains information that is characteristic of the content in the sample. The fingerprint may be generated by computing an energy spectrum for the audio sample, resampling the energy spectrum logarithmically in the time dimension, transforming the resampled energy spectrum to produce a series of feature vectors, and computing the fingerprint using differential coding of the feature vectors. The generated fingerprint can be compared to a set of reference fingerprints in a database to identify the original audio content.

The present invention provides a technique for determining a search range using metadata that is associated with information (file) of an image as well as determining granularity of the search range based on a unit of numerical information included in a query when a file is searched from a database. More particularly, an information search apparatus searches a plurality of files that include numerical information. As a query for determining the search range, a first numerical value and a keyword are input, a unit of the first numerical value is determined, the second numerical value of the unit that corresponds to the keyword is acquired, and a file included in the search range that is determined based on the first the second numerical values is searched from the plurality of files.

A shared control channel structure includes at least one control channel to be allocated at least to a user for at least one of uplink and downlink directions in a network, which the at least one control channel is arranged as at least a part of a modular structure comprising of modular code blocks on at least two different sizes. One of such modular structures may be represented as a tree structure in particular, where each of the modular code blocks define one node of the tree, respectively.

A method and system for facilitating a keyword search request initiated at a client station within a multilevel data network, wherein the multilevel data network includes multiple local sites each containing multiple data pages. Multiple keywords from each of the data pages within the local sites of the multilevel data network are stored locally and indexed such that each of the keywords points to one or more of the data pages in which the keywords are contained. The keywords and their index associations are locally updated. A central database is utilized to compile and index the locally indexed keywords from each of the local sites, such that each of the keywords in the central database points to one or more local sites from which those keywords came in response to a keyword search initiated at the client station.

An audio fingerprint is extracted from an audio sample, where the fingerprint contains information that is characteristic of the content in the sample. The fingerprint may be generated by computing an energy spectrum for the audio sample, resampling the energy spectrum logarithmically in the time dimension, transforming the resampled energy spectrum to produce a series of feature vectors, and computing the fingerprint using differential coding of the feature vectors. The generated fingerprint can be compared to a set of reference fingerprints in a database to identify the original audio content.

A method and system generates and compares fingerprints for videos in a video library. The video fingerprints provide a compact representation of the temporal locations of discontinuities in the video that can be used to quickly and efficiently identify video content. Discontinuities can be, for example, shot boundaries in the video frame sequence or silent points in the audio stream. Because the fingerprints are based on structural discontinuity characteristics rather than exact bit sequences, visual content of videos can be effectively compared even when there are small differences between the videos in compression factors, source resolutions, start and stop times, frame rates, and so on. Comparison of video fingerprints can be used, for example, to search for and remove copyright protected videos from a video library. Furthermore, duplicate videos can be detected and discarded in order to preserve storage space.

A method and system generates and compares fingerprints for videos in a video library. The video fingerprints provide a compact representation of the spatial and sequential characteristics of the video that can be used to quickly and efficiently identify video content. Because the fingerprints are based on spatial and sequential characteristics rather than exact bit sequences, visual content of videos can be effectively compared even when there are small differences between the videos in compression factors, source resolutions, start and stop times, frame rates, and so on. Comparison of video fingerprints can be used, for example, to search for and remove copyright protected videos from a video library. Further, duplicate videos can be detected and discarded in order to preserve storage space.

A used car information search method of inputting a search condition containing car type information for specifying a type of a used car, searching for used car data coincident with the search condition from a used car database containing the car type information and price information, and outputting the searched used car data. This method comprises a step of researching the price information in all records of used car data coincident with the car type information contained in the search condition, and creating price research information, and a step of transmitting the used car data coincident with the search condition and the price research information for displaying them to a user. This scheme enables an efficient search for the used car information regardless of how much a prospective purchaser is skilled at searching.

A wireless searching method through Wireless Application Protocol (WAP) which includes the steps of: submitting a query by a user of a mobile terminal to a search engine through a wireless telecommunication network; matching at least a query history stored in a user preference file with the query; and selecting the query history to retrieve information of the query history at the mobile terminal. Therefore, the user is able to quickly and precisely to obtain a search result through the mobile terminal by accessing the user preference file in the search engine.

A technique efficiently searches a hash table. Conventionally, a predetermined set of “signature” information is hashed to generate a hash-table index which, in turn, is associated with a corresponding linked list accessible through the hash table. The indexed list is sequentially searched, beginning with the first list entry, until a “matching” list entry is located containing the signature information. For long list lengths, this conventional approach may search a substantially large number of list entries. In contrast, the inventive technique reduces, on average, the number of list entries that are searched to locate the matching list entry. To that end, list entries are partitioned into different groups within each linked list. Thus, by searching only a selected group (e.g., subset) of entries in the indexed list, the technique consumes fewer resources, such as processor bandwidth and processing time, than previous implementations.

Methods and system for identifying multimedia content streaming through a television includes retrieving an audio signal from a multimedia content selected for rendering at the television. The retrieved audio signal is partitioned into a plurality of segments of small intervals. A particular segment is analyzed to identify acoustic modulation and to generate a distinct vector for the particular segment based on the acoustic modulation, wherein the vector defines a unique fingerprint of the particular segment of the audio signal. A content database on a server is queried using the vector of the particular segment to obtain content information for multimedia content that matches the fingerprint of the particular segment. The content information is used to identify the multimedia content and the source of the multimedia content that matches the audio signal received for rendering.

An internet based method of facilitating commerce between shippers and carriers includes the steps of capturing electronic shipment requests for available shipments, the shipment requests including shipment specific criteria and carrier access criteria, and storing the electronic shipment requests in a database. The electronic shipment requests are presented for action to the remote carriers meeting the carrier access criteria. These remote carriers may reply to the shipment requests with fulfillment offers, which are responsive to the presented shipment requests. Carrier fulfillment offers are received and presented to the remote shippers originating the electronic shipment requests. An Internet based system for implementing the method of the present invention is also disclosed.

A system and method for optimizing a database query with improved performance enhancements is herein disclosed. The database query consists of one or more logical expressions. Through the repeated application of one or more rules, the logical expressions are transformed into execution plans. The query optimizer partitions the database query into one or more subproblems with each subproblem consisting of one or more logical expressions. A plan is obtained for each subproblem with the plan for the database query including the plans for each subproblem. The query optimizer is cost-based and uses rules including transformation and implementation rules that are used to perform transformations on the logical expressions in a subproblem in order to produce a plan. The rules are classified into context-free and context-sensitive in order to avoid generating duplicate expressions. Context-free rules are applied once for each logical expression and context-sensitive rules are applied once for each logical expression for a particular optimization goal. In a preferred embodiment, the query optimizer performs several optimization passes over the database query in order to obtain an optimal plan. For each pass, if no optimal plan exists for the requested optimization goal, existing plans having the same optimization goal are utilized with each input reoptimized for a more cost effective plan.

Methods and systems are provided for controlling access to a file system. A record of actual accesses by users of the file system is maintained. Before a user is removed from a set of users or before a privilege for a set of users to access a data element is removed, it is determined whether the actual recorded accesses of the user are allowed by residual access permissions that would remain after implementing the proposed removal of access permission. An error condition is generated if the proposed removal of the access permission would have prevented at least one of the actual accesses. In another aspect of the invention, the system determines if the users would have alternate access to the storage element following implementation of the proposal.

Information is gathered from merchants such as car dealers by online forms or other means soliciting particular differentiating factors such as services and specialties (e.g., languages spoken, financing options, other information). When a consumer desires to perform a search, he or she is asked by the exemplary illustrative non-limiting implementation to input a geographical location. The illustrative exemplary non-limiting implementation may then access the merchant database and retrieve listings that comply with the geographical restraint the user requested. Those listings may be further filtered based on the user's specification of additional constraints related to specialties and / or servicesBy conveniently selecting such options (e.g., in one implementation, by simply checking a box on a web page), the users can be automatically presented with a new, filtered listing that lists only those merchants meeting the predetermined criteria the user has specified.

When a search query is received, a plurality of partition indexes are searched using the set of search terms in the search query. Each partition index corresponds to a partition of a document index. The search of each respective partition index identifies a subset of a plurality of document index sub-partitions corresponding to the respective partition index. Next, the search query is executed by only those document index sub-partitions identified by the subsets, thereby identifying documents that satisfy the search query. By using the partition index to reduce the number of document index sub-partitions searched while executing a search query, the execution of the search query is made more efficient.

With the proliferation of travel websites, users must separately search competing travel websites to find a travel service that satisfies their travel preferences. A travel agent is provided for automatically searching multiple travel websites for travel services satisfying search criteria that are based on a user's travel preferences. The travel agent implements a search strategy to automatically access, navigate, and parse one or more travel websites, enter search parameters, and extract data associated with relevant travel services. The travel agent can execute on a user's personal computer to harness the computational power of the personal computer and reduce the burden on centralized servers that search for travel services. Moreover, by storing a user's travel preferences on the same personal computer, the travel agent reduces access times to user data and protects it from insecurities associated with transmission over a network.

For a system in which data packets are to be handled according to one of several rules, depending on two (or more) criteria present in each packet, such as source and destination addresses, a classification method is disclosed that allows to determine the applicable rule by a longest-matching-prefix search operation. Range tokens of non-uniform length are assigned to basic ranges of criterion values so that each combination of input values from a packet can be represented by a particular variable length combination of range tokens. A search tree containing stored rule identifiers is so designed that each particular range token combination, used as input for a longest-matching-prefix lookup operation, will provide the required identifier. Different range token combinations having the same prefix can use the same path to one stored rule identifier, so that this method reduces the storage and time requirements for the classification procedure and allows simple updating when rules change.

A technique for obtaining digital objects (such as songs or video clips) from information providers in data communication networks (such as the Internet); the digital objects being sent through channels (such as Internet radio channels or Internet TV channels) or being otherwise made available. The end-user gains several advantages over techniques supported by the known art. For example, end-users may easily locate desired digital objects, need not be connected during object capture, can be connected through a low speed connection, does not have to have a high capacity computer, can obtain digital objects legally, can receive supplemental information associated with the digital objects, can quickly scan a vast number of digital object having been sent earlier, need not have the required storage space for the digital objects available during object capture, can easily navigate through a multitude of digital object channels, can easily obtain objects with a certain desired quality, can easily obtain objects in a certain desired format, can legally obtain digital objects at no cost and can prove that the digital objects were actually obtained legally.

A method and system for implementing a browser based information extraction and transmission method. A method and system for identifying, extracting, and transmitting predefined structured information from web pages browser interface. The extracted information is then added to a user profile on a social network and a database. The information is shared with other users who can comment, copy, vote on, or go to the original information source. The information can be combined with other extracted information to form collections for the purposes of voting on one or more items in the collection, combining multiple items to form a useful kit, saving information for later use, adding addition information such as dates and purchase location for personal inventory purposes, and for saving bookmarks to structured data.

An interactive wagering application is provided that assists users in finding races on which the users desire to wager on and that assists users in placing wagers on the desired races. The application may provide a search feature that allows the user to search for races based on user inputted search criteria such as favorite jockey, trainer, runner, or any suitable combination thereof. The application may also provide a next hour feature that searches for upcoming races that start within a certain time period. The application may also display an interactive overlay that contains information to assist users in creating a wager. The interactive overlay may be displayed when a user highlights or points to information. The interactive overlay may contain, for example, an estimated current payout for a specific wager amount, the total amount of the wager, the weather conditions at a racetrack, or any other suitable information. The application may be implemented using platforms based on set-top boxes, personal computers, handheld computing devices, cellular telephones, or other suitable devices.

The invention discloses a commendation method of personalized resource information based on scene information. The method comprises: pre-processing the web page of a synergic labeling system, storing the information of all labeling behaviors of a user according to the information of the labeling behaviors, wherein the information is extruded by a specific user and comprises labeled resource information, used tag information and labeled time information; generating grading data expressing user preferences according to the tag information that the user uses the resources in a database and the time information of the labeled resource; calculating the similarity among users based on the generated grading data expressing the user preference so as to determine that the users with similar interest are adjacent; commending the resource that is not labeled by the user to the users according to the adjacent preference information of the users to complete the commendation of synergic filtrated personalized resource. Experiments show that better personalized commendation service can be provided for the users through integrating the scene information.

Information retrieval with unified search between heterogeneous objects is described. The method includes: indexing a first object as a document in a search index; referencing a second object related to the first object in a facet of the document; and storing a relationship strength between the first and second objects in the facet of the document in the search index. Multiple heterogeneous objects can be related to the first object and referenced in multiple facets of the document, each with its relationship strength to the first object. Scoring an indirect object by indirect relation to a query object can be carried out by aggregating the relationship strengths between the indirect object and the retrieved objects multiplied by the retrieved objects' direct scores of relationship strength to the query object.

The invention relates to a network flow rapid distributing method, comprising steps of: 1) Defining a plurality of high speed server groups and filling each high speed server group in hash table according to ordering or appointed sequence; 2) Defining one or more backup server groups; 3) extracting URL when receiving client requests; 4) calculating a key value according to URL by using hash algorithm; 5) molding the key by number of effective items of the hash table, then finding corresponding server groups from the hash table according to obtained modulus; 6) Distributing the client requests to found server groups. Health check is applied on the high speed server groups regularly when processing above steps, if the server groups are valid, the server groups are used; if the server groups are invalid, backup server groups are used. The invention distributes the network flow evenly to a plurality of servers, and solving the problem that data storage redundancy and non-recoverable loss data of the server in former load equalizing strategy.

A method and apparatus for purchasing an airline ticket and other travel services that includes entering into a computer, information describing a service such as a flight desired by a consumer. The present invention is embodied via a graphical user interface for a travel planning system is described. The graphical user interface is implemented as a web page and includes a tabular region of the graphical user interface that displays summarized travel options and comprises a plurality of cells that act as controls.