2107 search results - page 64 / 422 » Computing Small Search Numbers in Linear Time |
137
Voted
WALCOM
2010
IEEE
15 years 29 days ago
2010
IEEE
Treewidth and pathwidth are important graph parameters that represent how close the graph is to trees and paths respectively. We calculate treewidth and pathwidth on parameterized ...
93
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
When foraging for information, users face a tradeoff between the accuracy and value of the acquired information and the time spent collecting it, a problem which also surfaces whe...
123
Voted
NCA
2007
IEEE
15 years 2 months ago
2007
IEEE
—Information about the spectral reflectance of a color surface is useful in many applications. Assuming that reflectance functions can be adequately approximated by a linear comb...
146
Voted
SPDP
1991
IEEE
15 years 6 months ago
1991
IEEE
The parallel genetic algorithm (PGA) is a prototype of a new kind of a distributed algorithm. It is based on a parallel search by individuals all of which have the complete proble...
147
Voted
CVPR
2010
IEEE
15 years 10 months ago
2010
IEEE
Searching approximate nearest neighbors in large scale high dimensional data set has been a challenging problem. This paper presents a novel and fast algorithm for learning binary...