Sciweavers

7978 search results - page 893 / 1596
» Combining shared-coin algorithms
Sort
View
ISSAC
2009
Springer
155views Mathematics» more  ISSAC 2009»
16 years 2 months ago
Parallel sparse polynomial multiplication using heaps
We present a high performance algorithm for multiplying sparse distributed polynomials using a multicore processor. Each core uses a heap of pointers to multiply parts of the poly...
Michael B. Monagan, Roman Pearce
IWPEC
2009
Springer
16 years 2 months ago
Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover
We describe a framework for expressing the complexity of algorithms for FPT problems with two separate parameters k, m and with exponential time bounds O∗ (xk ym ) where x, y &g...
Peter Damaschke
PKDD
2009
Springer
129views Data Mining» more  PKDD 2009»
16 years 2 months ago
Considering Unseen States as Impossible in Factored Reinforcement Learning
Abstract. The Factored Markov Decision Process (FMDP) framework is a standard representation for sequential decision problems under uncertainty where the state is represented as a ...
Olga Kozlova, Olivier Sigaud, Pierre-Henri Wuillem...
ROBOCUP
2009
Springer
214views Robotics» more  ROBOCUP 2009»
16 years 2 months ago
Real-Time Ball Tracking in a Semi-automated Foosball Table
In this article a method is proposed for ball tracking using 100 Hz computer vision in a semi-automated foosball table. In this application the behavior of the ball is highly dynam...
Rob Janssen, Jeroen de Best, René van de Mo...
SCALESPACE
2009
Springer
16 years 2 months ago
Generic Scene Recovery Using Multiple Images
In this paper, a generative model based method for recovering both the shape and the reflectance of the surface(s) of a scene from multiple images is presented, assuming that illu...
Kuk-Jin Yoon, Emmanuel Prados, Peter F. Sturm