Sciweavers

676 search results - page 31 / 136
» A Search-Free Intersection Algorithm
Sort
View
CORR
2011
Springer
205views Education» more  CORR 2011»
13 years 1 months ago
Algorithms for Implicit Hitting Set Problems
A hitting set for a collection of sets is a set that has a nonempty intersection with each set in the collection; the hitting set problem is to find a hitting set of minimum card...
Karthekeyan Chandrasekaran, Richard Karp, Erick Mo...
GIS
2010
ACM
13 years 8 months ago
Decentralized querying of topological relations between regions without using localization
This paper proposes an efficient, decentralized algorithm for determining the topological relationship between two regions monitored by a geosensor network. Many centralized algo...
Matt Duckham, Myeong Hun Jeong, Sanjiang Li, Joche...
SODA
2012
ACM
243views Algorithms» more  SODA 2012»
12 years 9 days ago
Bidimensionality and geometric graphs
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh
ICCV
2011
IEEE
12 years 10 months ago
Tracking Multiple People under Global Appearance Constraints
In this paper, we show that tracking multiple people whose paths may intersect can be formulated as a convex global optimization problem. Our proposed framework is designed to exp...
Horesh Ben Shitrit, Jerome Berclaz, Francois Fleur...
WSCG
2003
177views more  WSCG 2003»
13 years 11 months ago
An Architecture for Hierarchical Collision Detection
We present novel algorithms for efficient hierarchical collision detection and propose a hardware architecture for a single-chip accelerator. We use a hierarchy of bounding volum...
Gabriel Zachmann, Günter Knittel