Sciweavers

1688 search results - page 170 / 338
» The Complexity of Rationalizing Matchings
Sort
View
COGSCI
2004
97views more  COGSCI 2004»
15 years 5 months ago
A rhythm recognition computer program to advocate interactivist perception
This paper advocates the main ideas of the interactive model of representation of Mark Bickhard and the assimilation/accommodation framework of Jean Piaget, through a rhythm recog...
Jean-Christophe Buisson
IPL
2002
118views more  IPL 2002»
15 years 5 months ago
Lower bounds for approximate polygon decomposition and minimum gap
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, int...
Joachim Gudmundsson, Thore Husfeldt, Christos Levc...
ICRA
2009
IEEE
125views Robotics» more  ICRA 2009»
15 years 3 months ago
Photometry-based visual servoing using light reflexion models
Abstract-- We present in this paper a way to achieve positioning tasks by visual servoing under complex luminance variations. To do that, we use as visual features the luminance of...
Christophe Collewet, Éric Marchand
POPL
2012
ACM
14 years 1 months ago
Analysis of recursively parallel programs
We propose a general formal model of isolated hierarchical parallel computations, and identify several fragments to match the concurrency constructs present in real-world programm...
Ahmed Bouajjani, Michael Emmi
EDBTW
2010
Springer
16 years 26 days ago
Updating probabilistic XML
We investigate the complexity of performing updates on probabilistic XML data for various classes of probabilistic XML documents of different succinctness. We consider two elemen...
Evgeny Kharlamov, Werner Nutt, Pierre Senellart