Sciweavers

919 search results - page 50 / 184
» Efficient computation of view subsets
Sort
View
ATAL
2006
Springer
14 years 14 days ago
Efficient agent-based cluster ensembles
Numerous domains ranging from distributed data acquisition to knowledge reuse need to solve the cluster ensemble problem of combining multiple clusterings into a single unified cl...
Adrian K. Agogino, Kagan Tumer
RECOMB
2008
Springer
14 years 9 months ago
Constructing Treatment Portfolios Using Affinity Propagation
A key problem of interest to biologists and medical researchers is the selection of a subset of queries or treatments that provide maximum utility for a population of targets. For ...
Delbert Dueck, Brendan J. Frey, Nebojsa Jojic, Vla...
STACS
2010
Springer
14 years 3 months ago
Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation
We construct efficient data structures that are resilient against a constant fraction of adversarial noise. Our model requires that the decoder answers most queries correctly with...
Victor Chen, Elena Grigorescu, Ronald de Wolf
DCOSS
2006
Springer
14 years 12 days ago
Efficient In-Network Processing Through Local Ad-Hoc Information Coalescence
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
Onur Savas, Murat Alanyali, Venkatesh Saligrama
BMVC
1998
13 years 10 months ago
Automatic Face Representation and Classification
A working face recognition system requires the ability to represent facial images in such a way that permits efficient and accurate processing. The human visual system effectively...
Daniel B. Graham, Nigel M. Allinson