3223 search results - page 162 / 645 » The Scaling of Search Cost |
161
click to vote
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
Our objective is to obtain a state-of-the art object category
detector by employing a state-of-the-art image classifier
to search for the object in all possible image subwindows....
166
click to vote
CVPR
2001
IEEE
16 years 8 months ago
2001
IEEE
We approach the problem of 2-D and 3-D puzzle solving by matching the geometric features of puzzle pieces three at a time. First, we define an affinity measure for a pair of piece...
169
click to vote
DAC
2008
ACM
16 years 7 months ago
2008
ACM
Boolean function bi-decomposition is a fundamental operation in logic synthesis. A function f(X) is bi-decomposable under a variable partition XA, XB, XC on X if it can be written...
195
click to vote
KDD
2006
ACM
16 years 6 months ago
2006
ACM
Order-preserving submatrixes (OPSMs) have been accepted as a biologically meaningful subspace cluster model, capturing the general tendency of gene expressions across a subset of ...
245
click to vote
VLDB
2007
ACM
16 years 6 months ago
2007
ACM
A "plan diagram" is a pictorial enumeration of the execution plan choices of a database query optimizer over the relational selectivity space. We have shown recently tha...