5316 search results - page 862 / 1064 » Which Search Problems Are Random |
120
click to vote
PAMI
2008
15 years 4 months ago
2008
This paper describes BoostMap, a method for efficient nearest neighbor retrieval under computationally expensive distance measures. Database and query objects are embedded into a v...
143
click to vote
IJON
2007
15 years 4 months ago
2007
The blind source separation (BSS) problem is often solved by maximizing objective functions reflecting the statistical independence between outputs. Since global maximization may...
116
click to vote
TEC
2008
15 years 4 months ago
2008
Recent research on compact genetic algorithms (cGAs) has proposed a number of evolutionary search methods with reduced memory requirements. In cGAs, the evolution of populations is...
138
click to vote
JMM2
2007
15 years 4 months ago
2007
—This paper aims to develop a novel framework to systematically trade-off computational complexity with output distortion in linear multimedia transforms, in an optimal manner. T...
139
click to vote
JSS
2007
15 years 4 months ago
2007
Discovering sequential patterns is an important problem for many applications. Existing algorithms find qualitative sequential patterns in the sense that only items are included ...