Sciweavers

1086 search results - page 76 / 218
» Jug measuring: Algorithms and complexity
Sort
View
CORR
2007
Springer
104views Education» more  CORR 2007»
14 years 9 months ago
Sorting and Selection in Posets
Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs...
Constantinos Daskalakis, Richard M. Karp, Elchanan...
KI
2010
Springer
14 years 7 months ago
Situation-Specific Intention Recognition for Human-Robot Cooperation
Recognizing human intentions is part of the decision process in many technical devices. In order to achieve natural interaction, the required estimation quality and the used comput...
Peter Krauthausen, Uwe D. Hanebeck

Book
376views
16 years 7 months ago
An Exploration of Random Processes for Engineers
"From an applications viewpoint, the main reason to study the subject of these notes is to help deal with the complexity of describing random, time-varying functions. A random...
Bruce Hajek
ECCC
2010
86views more  ECCC 2010»
14 years 9 months ago
On Approximating the Entropy of Polynomial Mappings
We investigate the complexity of the following computational problem: Polynomial Entropy Approximation (PEA): Given a low-degree polynomial mapping p : Fn Fm , where F is a finite...
Zeev Dvir, Dan Gutfreund, Guy N. Rothblum, Salil P...
ISVC
2010
Springer
14 years 8 months ago
Robust Rigid Shape Registration Method Using a Level Set Formulation
Abstract. This paper presents a fast algorithm for robust registration of shapes implicitly represented by signed distance functions(SDF). The proposed algorithm aims to recover th...
Muayed S. Al-Huseiny, Sasan Mahmoodi, Mark S. Nixo...