4850 search results - page 352 / 970 » Proof and Computation in Geometry |
201
click to vote
COCOA
2010
Springer
15 years 4 months ago
2010
Springer
The classical and well-studied group testing problem is to find d defectives in a set of n elements by group tests, which tell us for any chosen subset whether it contains defectiv...
139
click to vote
TCS
2010
15 years 5 months ago
2010
We give a new construction of strongly aperiodic set of tiles in H2 , exhibiting a kind of hierarchical structure, simplifying the central framework of Margenstern’s proof that t...
170
click to vote
ICIP
2007
IEEE
16 years 8 months ago
2007
IEEE
Depth recovery for active binocular vision systems is simplified if the camera geometry is known and corresponding points can be restricted to epipolar lines. Unfortunately, compu...
165
click to vote
DGCI
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. This paper presents new results about digital straight segments, their recognition and related properties. They come from the study of the arithmetically based recognitio...
180
click to vote
COMPGEOM
2008
ACM
15 years 8 months ago
2008
ACM
We show that the vertices of any plane graph in which every face is of length at least g can be colored by (3g - 5)/4 colors so that every color appears in every face. This is nea...