2654 search results - page 272 / 531 » On Pairing Inversion Problems |
186
click to vote
ICCSA
2007
Springer
16 years 22 days ago
2007
Springer
Abstract. Determining whether two segments s and t in a planar polygonal scene weakly see each other is a classical problem in computational geometry. In this problem we seek for a...
166
click to vote
SPIRE
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. A set of sequences S is pairwise bounded if the Hamming distance between any pair of sequences in S is at most 2d. The Consensus Sequence problem aims to discern between ...
190
click to vote
DGCI
2006
Springer
15 years 10 months ago
2006
Springer
Tomography deals with the reconstruction of images from their projections. In this paper we focus on tomographic reconstruction of binary images (i.e., black-and-white) that do not...
158
click to vote
CP
2005
Springer
16 years 4 days ago
2005
Springer
Constrained path problems have to do with finding paths in graphs subject to constraints. One way of constraining the graph is by enforcing reachability on nodes. For instance, i...
183
click to vote
ICS
2010
Tsinghua U.
16 years 4 months ago
2010
Tsinghua U.
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...