Sciweavers

199 search results - page 1 / 40
» Combinatorial Constraints on Multiple Projections of a Set o...
Sort
View
ICCV
2003
IEEE
13 years 10 months ago
Combinatorial Constraints on Multiple Projections of a Set of Points
Multiple projections of a scene cannot be arbitrary, the allowed configurations being given by matching constraints. This paper presents new matching constraints on multiple proj...
Tomás Werner
JCDCG
2004
Springer
13 years 10 months ago
Farthest-Point Queries with Geometric and Combinatorial Constraints
In this paper we discuss farthest-point problems in which a set or sequence S of n points in the plane is given in advance and can be preprocessed to answer various queries efficie...
Ovidiu Daescu, Ningfang Mi, Chan-Su Shin, Alexande...
TASE
2010
IEEE
12 years 11 months ago
Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
CORR
2011
Springer
177views Education» more  CORR 2011»
12 years 12 months ago
A Truthful Randomized Mechanism for Combinatorial Public Projects via Convex Optimization
In Combinatorial Public Projects, there is a set of projects that may be undertaken, and a set of selfinterested players with a stake in the set of projects chosen. A public plann...
Shaddin Dughmi
MFCS
2007
Springer
13 years 11 months ago
Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete
Abstract. We introduce a new general polynomial-time constructionthe fibre construction- which reduces any constraint satisfaction problem CSP(H) to the constraint satisfaction pr...
Jaroslav Nesetril, Mark H. Siggers