236 search results - page 15 / 48 » Binary Partitions Revisited |
RTA
2010
Springer
14 years 1 months ago
2010
Springer
Infinitary Term Rewriting allows to express infinitary terms and infinitary reductions that converge to them. As their notion of transfinite reduction in general, and as binary...
COMPGEOM
2010
ACM
14 years 2 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
PAAPP
2006
13 years 9 months ago
2006
In this paper, we investigate algorithms for generating communication code to run on distributedmemory systems. We modify algorithms from previously published work and prove that ...
ICIP
2002
IEEE
14 years 11 months ago
2002
IEEE
In this work, we study the extraction of semantic objects from still images. We combine different ideas to extract them in a structured manner together with a perceptual metric th...
IMR
2003
Springer
14 years 3 months ago
2003
Springer
In this paper we tackle the problem of tetrahedralization by breaking non-convex polyhedra into convex subpolyhedra, tetrahedralizing these convex subpolyhedra and merging them to...