7015 search results - page 316 / 1403 » Approximation algorithms for co-clustering |
224
click to vote
ESA
2007
Springer
16 years 26 days ago
2007
Springer
We present an experimental evaluation of an approximate distance oracle recently suggested by Thorup [1] for undirected planar graphs. The oracle uses the existence of graph separa...
203
click to vote
ISAAC
2007
Springer
16 years 25 days ago
2007
Springer
In this paper, we present two linear-size external memory data structures for approximate range searching. Our first structure, the BAR-B-tree, stores a set of N points in Rd and ...
160
click to vote
SPIRE
2007
Springer
16 years 24 days ago
2007
Springer
Abstract. A compressed full-text self-index for a text T is a data structure requiring reduced space and able of searching for patterns P in T. Furthermore, the structure can repro...
140
click to vote
WDAG
2007
Springer
16 years 24 days ago
2007
Springer
We describe and analyze a 3-state one-way population protocol to compute approximate majority in the model in which pairs of agents are drawn uniformly at random to interact. Given...
160
click to vote
WECWIS
2005
IEEE
16 years 8 days ago
2005
IEEE
Singular Value Decomposition (SVD), together with the Expectation-Maximization (EM) procedure, can be used to find a low-dimension model that maximizes the loglikelihood of obser...