244 search results - page 10 / 49 » A Linear Search Strategy using Bounds |
ICML
2006
IEEE
14 years 9 months ago
2006
IEEE
We present a discrete spectral framework for the sparse or cardinality-constrained solution of a generalized Rayleigh quotient. This NPhard combinatorial optimization problem is c...
JCO
2010
13 years 7 months ago
2010
Rocchio’s similarity-based relevance feedback algorithm, one of the most important query reformation methods in information retrieval, is essentially an adaptive supervised lear...
INFOCOM
2010
IEEE
13 years 7 months ago
2010
IEEE
Abstract—The main task in analyzing a switching network design (including circuit-, multirate-, and photonic-switching) is to determine the minimum number of some switching compo...
IJCAI
2007
13 years 10 months ago
2007
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
JACM
2007
13 years 8 months ago
2007
We introduce exponential search trees as a novel technique for converting static polynomial space search structures for ordered sets into fully-dynamic linear space data structure...