465 search results - page 20 / 93 » On the Hardness of Range Assignment Problems |
SAT
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clau...
MFCS
2005
Springer
15 years 5 months ago
2005
Springer
In the maximum solution equation problem a collection of equations are given over some algebraic structure. The objective is to find an assignment to the variables in the equation...
JPDC
2008
14 years 11 months ago
2008
Let P be a polygonal region which is forbidden for placing a base station in the context of mobile communication. Our objective is to place one base station at any point on the bo...
177
click to vote
PODS
2009
ACM
16 years 10 days ago
2009
ACM
The B-tree is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of N keys, a range query can be answere...
122
click to vote
CVPR
2005
IEEE
16 years 1 months ago
2005
IEEE
This paper presents a novel and efficient algorithm for the 3D range to 2D image registration problem in urban scene settings. Our input is a set of unregistered 3D range scans an...