Sciweavers

2570 search results - page 130 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
SDM
2010
SIAM
195views Data Mining» more  SDM 2010»
15 years 4 months ago
MACH: Fast Randomized Tensor Decompositions
Tensors naturally model many real world processes which generate multi-aspect data. Such processes appear in many different research disciplines, e.g, chemometrics, computer visio...
Charalampos E. Tsourakakis
121
Voted
CVPR
2003
IEEE
16 years 5 months ago
Object Segmentation in Videos from Moving Camera with MRFs on Color and Motion Features
In this paper we address the problem of fast segmenting moving objects in video acquired by moving camera or more generally with a moving background. We present an approach based ...
Rita Cucchiara, Andrea Prati, Roberto Vezzani
130
Voted
PODC
2009
ACM
15 years 10 months ago
Fast scalable deterministic consensus for crash failures
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
Bogdan S. Chlebus, Dariusz R. Kowalski, Michal Str...
126
Voted
PRDC
2009
IEEE
15 years 10 months ago
An Early-Stopping Protocol for Computing Aggregate Functions in Sensor Networks
Abstract—In this paper, we study algebraic aggregate computations in Sensor Networks. The main contribution is the presentation of an early-stopping protocol that computes the av...
Antonio Fernández Anta, Miguel A. Mosteiro,...
157
Voted
FOCS
2000
IEEE
15 years 7 months ago
Topological Persistence and Simplification
We formalize a notion of topological simplification within the framework of a filtration, which is the history of a growing complex. We classify a topological change that happens ...
Herbert Edelsbrunner, David Letscher, Afra Zomorod...