1105 search results - page 192 / 221 » Approximate Spectral Clustering. |
ICDAR
2011
IEEE
12 years 7 months ago
2011
IEEE
Word searching and indexing in historical document collections is a challenging problem because, characters in these documents are often touching or broken due to degradation/agei...
ICDE
2012
IEEE
11 years 10 months ago
2012
IEEE
We present a new Bi-level LSH algorithm to perform approximate k-nearest neighbor search in high dimensional spaces. Our formulation is based on a two-level scheme. In the first ...
COMPGEOM
2006
ACM
14 years 1 months ago
2006
ACM
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
ICCAD
2001
IEEE
14 years 4 months ago
2001
IEEE
In high-speed digital VLSI design, bounding the load capacitance at gate outputs is a well-known methodology to improve coupling noise immunity, reduce degradation of signal trans...
WORM
2004
13 years 9 months ago
2004
A major challenge when attempting to analyze and model large-scale Internet phenomena such as the dynamics of global worm propagation is finding ate abstractions that allow us to ...