Sciweavers

7648 search results - page 847 / 1530
» A Data Locality Optimizing Algorithm
Sort
View
155
Voted
MICRO
2002
IEEE
114views Hardware» more  MICRO 2002»
16 years 10 days ago
Characterizing and predicting value degree of use
A value’s degree of use—the number of dynamic uses of that value—provides the most essential information needed to optimize its communication. We present simulation results ...
J. Adam Butts, Gurindar S. Sohi
217
Voted
UAI
2000
15 years 8 months ago
Rao-Blackwellised Particle Filtering for Dynamic Bayesian Networks
Particle filters (PFs) are powerful samplingbased inference/learning algorithms for dynamic Bayesian networks (DBNs). They allow us to treat, in a principled way, any type of prob...
Arnaud Doucet, Nando de Freitas, Kevin P. Murphy, ...
SIGIR
2004
ACM
16 years 25 days ago
Document clustering via adaptive subspace iteration
Document clustering has long been an important problem in information retrieval. In this paper, we present a new clustering algorithm ASI1, which uses explicitly modeling of the s...
Tao Li, Sheng Ma, Mitsunori Ogihara
184
Voted
CVPR
2008
IEEE
16 years 1 months ago
Subspace segmentation with outliers: A grassmannian approach to the maximum consensus subspace
Segmenting arbitrary unions of linear subspaces is an important tool for computer vision tasks such as motion and image segmentation, SfM or object recognition. We segment subspac...
Nuno Pinho da Silva, João Paulo Costeira
ESA
2006
Springer
140views Algorithms» more  ESA 2006»
15 years 11 months ago
Latency Constrained Aggregation in Sensor Networks
A sensor network consists of sensing devices which may exchange data through wireless communication. A particular feature of sensor networks is that they are highly energy constrai...
Luca Becchetti, Peter Korteweg, Alberto Marchetti-...