1105 search results - page 64 / 221 » Approximate Spectral Clustering. |
106
Voted
HOTOS
2007
IEEE
15 years 4 months ago
2007
IEEE
Existing distributed hash tables provide efficient mechanisms for storing and retrieving a data item based on an exact key, but are unsuitable when the search key is similar, but ...
90
Voted
NCA
2008
IEEE
15 years 19 days ago
2008
IEEE
IJON
2007
15 years 18 days ago
2007
135
Voted
ICASSP
2010
IEEE
15 years 27 days ago
2010
IEEE
Handling large amounts of data, such as large image databases, requires the use of approximate nearest neighbor search techniques. Recently, Hamming embedding methods such as spec...
APPROX
2004
Springer
15 years 6 months ago
2004
Springer
We study the problem of minimizing the broadcast time for a set of processors in a cluster, where processor has transmission time , which is the time taken to send a message to any...