9842 search results - page 1688 / 1969 » The Complexity of the Matching-Cut Problem |
153
click to vote
SIBGRAPI
2008
IEEE
15 years 11 months ago
2008
IEEE
Range searching is a fundamental problem in computational geometry. The problem involves preprocessing a set of n points in Rd into a data structure, so that it is possible to det...
165
click to vote
ICCV
2007
IEEE
15 years 10 months ago
2007
IEEE
Multi-chamber heart segmentation is a prerequisite for global quantification of the cardiac function. The complexity of cardiac anatomy, poor contrast, noise or motion artifacts ...
165
click to vote
ICRA
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract— In this paper, we present an image-based markerless human motion capture system, intended for humanoid robot systems. The restrictions set by this ambitious goal are nu...
189
click to vote
RTSS
2007
IEEE
15 years 10 months ago
2007
IEEE
Recent technological advances have opened up several distributed real-time applications involving battery-driven embedded devices with local processing and wireless communication ...
148
click to vote
ALGOSENSORS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We consider the problem of counting the number of indistinguishable targets using a simple binary sensing model. Our setting includes an unknown number of point targets i...