Sciweavers

2520 search results - page 478 / 504
» The complexity of approximating entropy
Sort
View
IBPRIA
2003
Springer
14 years 2 months ago
A Colour Tracking Procedure for Low-Cost Face Desktop Applications
In this paper we present an environment for the tracking of a human face obtained from a real video sequence. We will describe the system and discuss the advantages and disadvanta...
Francisco J. Perales López, Ramon Mas, Miqu...
PODS
2010
ACM
232views Database» more  PODS 2010»
14 years 2 months ago
Optimal sampling from distributed streams
A fundamental problem in data management is to draw a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With large, streamin...
Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang
FOCS
2002
IEEE
14 years 2 months ago
Protocols and Impossibility Results for Gossip-Based Communication Mechanisms
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...
David Kempe, Jon M. Kleinberg
LICS
2002
IEEE
14 years 2 months ago
Probabilistic Abstraction for Model Checking: An Approach Based on Property Testing
istic Abstraction for Model Checking: an Approach Based on Property Testing∗ Sophie Laplante† Richard Lassaigne‡ Fr´ed´eric Magniez§ Sylvain Peyronnet† Michel de Rougemo...
Sophie Laplante, Richard Lassaigne, Fréd&ea...
SIGECOM
2010
ACM
183views ECommerce» more  SIGECOM 2010»
14 years 2 months ago
The unavailable candidate model: a decision-theoretic view of social choice
One of the fundamental problems in the theory of social choice is aggregating the rankings of a set of agents (or voters) into a consensus ranking. Rank aggregation has found appl...
Tyler Lu, Craig Boutilier