Results 1  10
of
151,278
1 An Efficient Search Algorithm for Fingerprint Databases
"... In this paper, we present an efficient search algorithm for fingerprint databases that store songs or data with a similar structure. A song is represented by a high dimensional binary vector using the audio fingerprinting technique. Audio fingerprinting extracts from a song a fingerprint which is a ..."
Abstract
 Add to MetaCart
In this paper, we present an efficient search algorithm for fingerprint databases that store songs or data with a similar structure. A song is represented by a high dimensional binary vector using the audio fingerprinting technique. Audio fingerprinting extracts from a song a fingerprint which is a
AN EFFICIENT SEARCH ALGORITHM FOR PARTIALLY ORDERED SETS
, 2006
"... Consider the problem of membership query for a given partially ordered set. We devise a greedy algorithm which can produce nearoptimal search strategies. Rigorous analysis has been given, which shows our algorithm can have fewer comparisons than the best known solution by at least a factor of 0.27 ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Consider the problem of membership query for a given partially ordered set. We devise a greedy algorithm which can produce nearoptimal search strategies. Rigorous analysis has been given, which shows our algorithm can have fewer comparisons than the best known solution by at least a factor of 0
AN EFFICIENT SEARCH ALGORITHM FOR PARTIALLY ORDERED SETS
"... Consider the problem of membership query for a given partially ordered set. We devise a greedy algorithm which can produce nearoptimal search strategies. Rigorous analysis has been given, which shows our algorithm can have fewer comparisons than the best known solution by at least a factor of 0.27 ..."
Abstract
 Add to MetaCart
Consider the problem of membership query for a given partially ordered set. We devise a greedy algorithm which can produce nearoptimal search strategies. Rigorous analysis has been given, which shows our algorithm can have fewer comparisons than the best known solution by at least a factor of 0
An efficient search algorithm to find the elementary circuits of a graph
 Commun. ACM
, 1970
"... to A theoretically most efficient search algorithm is presented which uses an exhaustive search to find all of the elementary circuits of a graph. The algorithm can be easily modified to find all of the elementary circuits with a particular attribute such as length. A rigorous proof of the algorithm ..."
Abstract

Cited by 35 (0 self)
 Add to MetaCart
to A theoretically most efficient search algorithm is presented which uses an exhaustive search to find all of the elementary circuits of a graph. The algorithm can be easily modified to find all of the elementary circuits with a particular attribute such as length. A rigorous proof
Intelligent Route Finding: Combining Knowledge, Cases and An Efficient Search Algorithm
 In Proceedings of the 12th European Conference on Artificial Intelligence
, 1996
"... : One of the major road transportation problems is route finding. With the massive and complicated road network of a modern city (or country), finding a good route to travel from one place to another is not a simple task. In Network Theory, this is a shortest path problem. Shortest path algorithms a ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
's feedback and learning from past experiences are also crucial to the success of a route finding system. In this paper, we present an integrated approach of using knowledge about the road network, past cases and an efficient search algorithm for route finding. This technique not only substantially reduces
An Efficient Boosting Algorithm for Combining Preferences
, 1999
"... The problem of combining preferences arises in several applications, such as combining the results of different search engines. This work describes an efficient algorithm for combining multiple preferences. We first give a formal framework for the problem. We then describe and analyze a new boosting ..."
Abstract

Cited by 727 (18 self)
 Add to MetaCart
The problem of combining preferences arises in several applications, such as combining the results of different search engines. This work describes an efficient algorithm for combining multiple preferences. We first give a formal framework for the problem. We then describe and analyze a new
An Efficient Search Algorithm for Motion Data Using Weighted PCA Abstract
"... Good motion data is costly to create. Such an expense often makes the reuse of motion data through transformation and retargetting a more attractive option than creating new motion from scratch. Reuse requires the ability to search automatically and efficiently a growing corpus of motion data, which ..."
Abstract
 Add to MetaCart
, which remains a difficult open problem. We present a method for quickly searching long, unsegmented motion clips for subregions that most closely match a short query clip. Our search algorithm is based on a weighted PCAbased pose representation that allows for flexible and efficient pose
Efficient Search Algorithms for Tiled Architectures in the Billion Transistor Era
"... Over the next decade the underlying architectural assumptions used in the design of parallel algorithms will change signicantly, likely impacting on the eciency of many wellknown parallel algorithms. Traditionally, parallel algorithms have been designed assuming a few powerful processors interconne ..."
Abstract
 Add to MetaCart
with highbandwidth, lowoverhead communication links. With the arrival of such negrained, highlyparallel architectures, that possibly provide thousands of simple processing elements connected with fast links, we need to have another look at the eciency of many wellknown parallel algorithms. Search
EFFICIENT SEARCH ALGORITHMS FOR LARGE VOCABULARY CONTINUOUS SPEECH RECOGNITION
, 1996
"... Automatic speakerindependent speech recognition has made significant progress from the days of isolated word recognition. Today state of the art systems are capable of performing largevocabulary continuous speech recognition (LVCSR) over complex domains such as news broadcasts and telephone conver ..."
Abstract
 Add to MetaCart
conversations. A significant contribution to this advancement in technology is due to the development of search techniques that support efficient, suboptimal decoding over large search spaces and complex statistical models. Moreover, these decoding strategies are capable of dynamically integrating information
Results 1  10
of
151,278