Sciweavers

5153 search results - page 841 / 1031
» Introduction to Randomized Algorithms
Sort
View
COMPGEOM
2010
ACM
15 years 8 months ago
A kinetic triangulation scheme for moving points in the plane
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
Haim Kaplan, Natan Rubin, Micha Sharir
154
Voted
SIGECOM
2010
ACM
170views ECommerce» more  SIGECOM 2010»
15 years 8 months ago
Optimal online assignment with forecasts
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
Erik Vee, Sergei Vassilvitskii, Jayavel Shanmugasu...
FUN
2010
Springer
233views Algorithms» more  FUN 2010»
15 years 8 months ago
The Complexity of Flood Filling Games
We study the complexity of the popular one player combinatorial game known as Flood-It. In this game the player is given an n×n board of tiles where each tile is allocated one of ...
David Arthur, Raphaël Clifford, Markus Jalsen...
NLPRS
2001
Springer
15 years 7 months ago
A Bayesian Approach to Semi-Supervised Learning
Recent research in automated learning has focused on algorithms that learn from a combination of tagged and untagged data. Such algorithms can be referred to as semi-supervised in...
Rebecca F. Bruce
ECCV
2000
Springer
15 years 7 months ago
Anti-Faces for Detection
This paper offers a novel detection method, which works well even in the case of a complicated image collection – for instance, a frontal face under a large class of linear tran...
Daniel Keren, Margarita Osadchy, Craig Gotsman