3946 search results - page 104 / 790 » The computational complexity of choice sets |
157
click to vote
ICALP
2003
Springer
15 years 11 months ago
2003
Springer
Resource-bounded dimension is a complexity-theoretic extension of classical Hausdorff dimension introduced by Lutz (2000) in order to investigate the fractal structure of sets th...
164
click to vote
VISUALIZATION
2005
IEEE
16 years 1 days ago
2005
IEEE
We present a practical and general-purpose approach to large and complex visual data analysis where visualization processing, rendering and subsequent human interpretation is cons...
174
click to vote
ICSE
2007
IEEE-ACM
16 years 6 months ago
2007
IEEE-ACM
Abstract. In software architecture, components represent the computational units of a system and connectors represent the interactions among those units. Making decisions about the...
181
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
In this paper, we propose a particle filtering approach for the problem of registering two point sets that differ by a rigid body transformation. Typically, registration algorithm...
158
click to vote
LPNMR
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. In answer-set programming (ASP), the main focus usually is on computing answer sets which correspond to solutions to the problem represented by a logic program. Simple re...