Sciweavers

1449 search results - page 236 / 290
» Self-Randomized Exponentiation Algorithms
Sort
View
DCC
2005
IEEE
16 years 5 months ago
When is Bit Allocation for Predictive Video Coding Easy?
This paper addresses the problem of bit allocation among frames in a predictively encoded video sequence. Finding optimal solutions to this problem potentially requires making an ...
Yegnaswamy Sermadevi, Jun Chen, Sheila S. Hemami, ...
VMCAI
2010
Springer
16 years 3 months ago
Improved Model Checking of Hierarchical Systems
We present a unified game-based approach for branching-time model checking of hierarchical systems. Such systems are exponentially more succinct than standard state-transition gra...
Benjamin Aminof, Orna Kupferman, Aniello Murano
ALT
2002
Springer
16 years 2 months ago
Optimally-Smooth Adaptive Boosting and Application to Agnostic Learning
We describe a new boosting algorithm that is the first such algorithm to be both smooth and adaptive. These two features make possible performance improvements for many learning ...
Dmitry Gavinsky
IROS
2009
IEEE
132views Robotics» more  IROS 2009»
16 years 19 days ago
Segregation in swarms of mobile robots based on the Brazil nut effect
— We study a simple algorithm inspired by the Brazil nut effect for achieving segregation in a swarm of mobile robots. The algorithm lets each robot mimic a particle of a certain...
Roderich Groß, Stéphane Magnenat, Fra...
ISAAC
2009
Springer
175views Algorithms» more  ISAAC 2009»
16 years 16 days ago
Worst-Case and Smoothed Analysis of k-Means Clustering with Bregman Divergences
The k-means algorithm is the method of choice for clustering large-scale data sets and it performs exceedingly well in practice. Most of the theoretical work is restricted to the c...
Bodo Manthey, Heiko Röglin