85 results about "Dichotomic search" patented technology

Parallel binary searches on lengths using hash tables is described. The parallel search uses more than one search instance. The search instances probe in parallel mutually different contiguous ranges of a search area during each round of searches. After each round, a new search area is defined and one or more search instances are redeployed into the new search area. The search instance for a range of shorter lengths can be redirected to help those of the longer lengths. Due to the help from other search instances, some ranges can be made large without sacrificing the performance. The invention realizes faster address lookups even for longer address lengths.

A system and method is provided for handling the collation of linguistic symbols of different languages that may have various types of compressions (e.g., from 2-to-1 to 8-to-1). A symbol table of the symbols identified as Unicode code points is generated, with each symbol tagged with a highest compression type of that symbol by sorting the compression tables of the various languages. During a sorting operation with respect to a given string, the tag of a symbol in the string is checked to identify the highest compression type of compressions beginning with that symbol, and the compression tables for the language with compression types equal or lower than the highest compression type of the symbol are searched using a binary search method to find a matching compression for the symbols in the string. A common search module is used to perform binary searches through compression tables of different compression types.

A delay library of high accuracy is efficiently generated within a short time period. To this end, a set-up time is calculated by static analysis with no consideration of a delay caused by a wire; the initial value of the search range for the next binary search cycle is set such that the set-up time is the median value of the search range (for example, the range of 0.5 ns is set); and correct set-up time α is obtained using binary search based on the initial value of the search range.

A method and apparatus for searching an electronically stored table of information including a plurality of table entries and facilitating high speed searching of a table to provide a longest matching entry. The table searching method uses at least one memory unit having a table of information including a plurality of data entries. The table of information has a plurality of search keys associated with the plurality of data entries and the plurality of search keys form a tree structure based on a prefix length for each of the search keys. The plurality of search keys are expanded such that each of the plurality of search keys has two lowest level search keys associated therewith that cover a lowest level of the tree structure. A binary search of the lowest level search keys is performed based on a search value to determine a longest prefix match. A data entry of the plurality of data entries is output based on said longest prefix match. The method is also applicable to routing data in an internet router where the routing of data packets depends on address information stored in the table of information.

A solution to disambiguate ambiguous merchant data in connection with processing a cashless transaction request in a real-time manner. Provided according to the present disclosure are a system and method including a binary-searchable non-transitory computer-readable medium is configure to store a first set of unambiguous merchant identification data having plural data entries therein, each entry corresponding to a merchant. A binary search of the first set of unambiguous merchant identification data is carried out using search keys based upon the ambiguous merchant identification data to determine whether one or more entries of the first set satisfies at least one of a hierarchical second set of partial match criteria for comparing the ambiguous merchant identification data with the first set of unambiguous merchant identification data. An entry of the first set of unambiguous merchant identification data is assigned to correspond with the ambiguous merchant identification data where at least a predetermined number of the second set of partial match criteria are met.

A joint photographic expert group (JPEG) Huffman table decoder and a method thereof based on a binary search technique. The JPEG Huffman table decoder performs symbol matching based on the binary search and calculates an address of the matched symbol in code book data. Comparison time and an amount of memory required for searching the symbols are reduced.

The invention discloses an apparatus and method for quickly searching and ranking related documents in a database based on user input queries. In operation, a user interface receives a query comprising a plurality of keywords input thereto from a user, the search engine receives the query, retrieves the sorted database which has been sorted in advance, performs a binary search on the sorted database to quickly produce a list of files-of-interest. The ranking engine uses the list of files-of-interest to search corresponding files in the list from the original database, score corresponding files based on a plurality of paragraph scores, where each paragraph score is calculated based on a number of matched keywords and adjacent distances between matched keywords within each paragraph, ranked files based on overall scores are then presented to the user on a display which further comprises an interactive window that allows the user to dynamically reselect a priority of a score among a plurality of scores for re-ranking corresponding files.

A value range for a code development option, which results in an error when applied to a given code, can be automatically searched to intelligently identify a threshold for the error within the value range. Instead of completely abandoning the optimizations offered by a code development option with a value range, the code development option as applied to a given code can be limited to a subrange of the value range, thus imbuing the given code with at least the optimizations offered by the code development option with the subrange. A failure analysis tool searches, for example according to binary search, a value range. Subranges are applied to the given code and results examined to influence successive selections of subranges. Eventually, a threshold, if any, is discovered that separates a subrange that does not result in error from a subrange that results in error.

The invention discloses a method for locating a non-homonymic phase overline earth fault of a double-circuit line based on binary search. The method includes the steps that firstly, fault phase voltage, fault phase current and zero-sequence current of the protection installing position of a I-circuit line of the double-circuit line on the same pole are measured, lumped parameter modeling is adopted, zero-sequence current of an II-circuit line of the double-circuit line on the same pole is calculated, zero-sequence compensating current of the I-circuit line of the double-circuit line on the same pole is calculated, the non-homonymic phase overline earth fault of the double-circuit line is accurately located by the adoption of a binary search method and through the characteristic that a relative coefficient of the positions in front of and behind the non-homonymic phase overline earth fault point is abruptly changed into a value smaller than 0 from a value larger than 0, the influences of interline zero-sequence mutual inductance, transition resistance and load current on fault locating accuracy are eliminated, high capacity for resisting the influences of the transition resistance and the load current is achieved, and no fault location dead zones exist when the non-homonymic phase overline earth fault of the double-circuit line is generated at a protection positive direction outlet.

The invention discloses a Lora terminal energy-saving method based on a binary search time slot randomization communication mechanism, which comprises an algorithm adopted by a Lora terminal, an MCU used by a terminal, and a Lora radio frequency module. The algorithm adopted by the Lora terminal Class B includes the following steps: S1: using the binary search algorithm to select and set an appropriate PingNb when a node receives a Beacon; S2: obtaining the offset PingOffset of a start time point of a Ping Slot of each node through time slot randomization; S3: entering the Ping Slot for data reception. The terminal algorithm uses the binary search algorithm to select and set the appropriate PingNb. Each time, the selection range can be reduced by half, and the set PingNb can be quickly andaccurately selected, which greatly shortens the communication time and saves more energy. The time slot randomization is adopted to obtain a cheap amount, it can be ensured that only one node in thePing Slot performs data, and additional energy consumption due to communication system collision or monitoring overload cannot be caused. The Lora terminal energy-saving method can effectively reducepower consumption and achieve energy saving.

A method and system for refining an estimated pitch period estimate based on a coarse pitch useful for performing frame loss concealment in an audio decoder as well as for other applications. A normalized correlation at the coarse pitch lag is computed and used as the current best candidate. The normalized correlation is then evaluated at the midpoint of the refinement pitch range on either side of the current best candidate. If the normalized correlation at either midpoint is greater than the current best lag, the midpoint with the maximum correlation is selected as the current best lag. After each iteration, the refinement range is decreased by a factor of two and centered on the current best lag. This bisectional search continues until the pitch has been refined to an acceptable tolerance or until the refinement range has been exhausted. During each step of the bisectional pitch refinement, the signal is decimated to reduce the complexity of computing the normalized correlation.

A method, system and computer program product for efficiently identifying images, videos, audio files or documents relevant to a user using binary search trees in attribute space for guiding relevance feedback. A binary tree is constructed for each relative attribute of interest. A “pivot exemplar” (at a node of the binary tree) is set for each relative attribute's binary tree as corresponding to the database image, video, audio file or document with a median relative attribute value among that subtree's child examples. A pivot exemplar out of the available current pivot exemplars that has the highest expected information gain is selected to be provided to the user. Comparative attribute feedback is then received from the user regarding whether a degree of the attribute in the user's target image, video, audio file or document is more, less or equal with the attribute displayed in the selected pivot exemplar.

The invention discloses an electronic dictionary words retrieval method based on a self-adaptive dictionary tree and relates to a words retrieval technology in an electronic dictionary. The method defines a retrieval structure with two levels which includes a prefix matching level of the self-adaptive dictionary and a complete words matching level for a piecewise dichotomy search. The retrieval method is that the matching of words prefixes is firstly implemented in the self-adaptive dictionary tree, and if the words prefixes are hit, the information of the words is returned. Otherwise, the piecewise dichotomy search level is started for the search, and the words to be searched for or the information of the words which is nearest to the words to be searched for is found out and returned. The electronic dictionary words retrieval method can be used for effectively improving the efficiency of the words search and ensuring the balance of time efficiency and space occupation.

The present invention relates to a method for deblurring a barcode image. The method includes the steps of: acquiring the terminal's n OTFs calculated by varying focal lengths for a subject; if a barcode image is inputted through the mobile terminal, fixing a specific value among NSRs as a value to be applied to an error metric of Wiener filtering, applying n PSFs calculated from the n OTFs to the error metric by a binary search algorithm and determining whether the result of the application to the error metric is not exceeding the pre-set threshold or not; and selecting a PSF value and an NSR value as values of Wiener filtering if the result of the application to the error metric is not exceeding the pre-set threshold and then performing the Wiener filtering to the inputted barcode image by using the selected PSF value and the selected NSR value.

The invention relates to an annealing strategy-based layout method for a circle packing problem, and the problem is that n given round cakes are arranged in a regular triangle container in a way that every two round cakes are not embedded mutually, wherein the side length of the triangle is L, and the minimal value of the L is determined. The method comprises the following steps: A, reading an input file, namely, data including the number of the round cake to be arranged and the Ri thereof (i is larger than or equal to 1 and smaller than or equal to n) for test cases; B, converting the problem of the circle packing problem in the triangular container into an unconstrained layout optimization problem through a quasi content strategy; C, solving the circle packing problem in the triangular container through a heuristic simulated annealing algorithm; D, taking the final layout obtained from the algorithm as an initial layout, and carrying out binary search to the side length L; and E, outputting the final result in a way of graphics and documents. The method provided by the invention has high feasibility and high processing speed, can obtain the result closer to a global optimal solution, and can be widely used to solve other layout optimization problems.

The present invention relates to a method for deblurring a barcode image. The method includes the steps of: acquiring the terminal's n OTFs calculated by varying focal lengths for a subject; if a barcode image is inputted through the mobile terminal, fixing a specific value among NSRs as a value to be applied to an error metric of Wiener filtering, applying n PSFs calculated from the n OTFs to the error metric by a binary search algorithm and determining whether the result of the application to the error metric is not exceeding the pre-set threshold or not; and selecting a PSF value and an NSR value as values of Wiener filtering if the result of the application to the error metric is not exceeding the pre-set threshold and then performing the Wiener filtering to the inputted barcode image by using the selected PSF value and the selected NSR value.

A method and apparatus for searching an electronically stored table of information including a plurality of table entries and facilitating high speed searching of a table to provide a longest matching entry. The table searching method uses at least one memory unit having a table of information including a plurality of data entries. The table of information has a plurality of search keys associated with the plurality of data entries and the plurality of search keys form a tree structure based on a prefix length for each of the search keys. The plurality of search keys are expanded such that each of the plurality of search keys has two lowest level search keys associated therewith that cover a lowest level of the tree structure. A binary search of the lowest level search keys is performed based on a search value to determine a longest prefix match. A data entry of the plurality of data entries is output based on said longest prefix match. The method is also applicable to routing data in an internet router where the routing of data packets depends on address information stored in the table of information.

In an audio encoding system that divides frames generated from input signals into multiple scale factor bands and that encodes each of the scale factor bands by using a scale factor, the invention provides a rate control apparatus that performs rate control based on an NMR, the rate control apparatus comprising an NMR determination unit that determines an NMR that does not exceed a target rate by a binary search; and a scale factor determination unit that determines, by a binary search, the largest scale factor corresponding to the NMR determined by the NMR determination unit and a rate. Each time the NMR determination unit selects an NMR candidate value that acts as a candidate when the NMR determination unit searches for an NMR by a binary search, the scale factor determination unit determines the scale factor corresponding to the NMR candidate value.