Sciweavers

354 search results - page 11 / 71
» Recovery Rate of Clustering Algorithms
Sort
View
ICDE
2011
IEEE
265views Database» more  ICDE 2011»
14 years 3 months ago
RAFTing MapReduce: Fast recovery on the RAFT
MapReduce is a computing paradigm that has gained a lot of popularity as it allows non-expert users to easily run complex analytical tasks at very large-scale. At such scale, task...
Jorge-Arnulfo Quiané-Ruiz, Christoph Pinkel...
CG
2006
Springer
14 years 11 months ago
Shape reasoning and understanding
s: clustering, denoising, sharp feature, shape abstraction, reverse engineering In this paper we describe a hierarchical face clustering algorithm for triangle meshes based on fit...
Bianca Falcidieno, Remco C. Veltkamp
INFOCOM
2010
IEEE
14 years 10 months ago
Toward the Practical Use of Network Tomography for Internet Topology Discovery
Abstract—Accurate and timely identification of the routerlevel topology of the Internet is one of the major unresolved problems in Internet research. Topology recovery via tomog...
Brian Eriksson, Gautam Dasarathy, Paul Barford, Ro...
JCB
2006
129views more  JCB 2006»
14 years 11 months ago
GenRate: A Generative Model that Reveals Novel Transcripts in Genome-Tiling Microarray Data
Genome-wide microarray designs containing millions to hundreds of millions of probes are available for a variety of mammals, including mouse and human. These genome tiling arrays ...
Brendan J. Frey, Quaid Morris, Timothy R. Hughes
TIT
2010
128views Education» more  TIT 2010»
14 years 6 months ago
Shannon-theoretic limits on noisy compressive sampling
In this paper, we study the number of measurements required to recover a sparse signal in M with L nonzero coefficients from compressed samples in the presence of noise. We conside...
Mehmet Akçakaya, Vahid Tarokh