Sciweavers

730 search results - page 97 / 146
» Combinatorics of Monotone Computations
Sort
View
COMPGEOM
2004
ACM
14 years 1 months ago
The number of lines tangent to arbitrary convex polyhedra in 3D
We prove that the lines tangent to four possibly intersecting convex polyhedra in   3 with n edges in total form Θ(n2 ) connected components in the worst case. In the generic ca...
Hervé Brönnimann, Olivier Devillers, V...
RECOMB
1998
Springer
13 years 12 months ago
A polyhedral approach to RNA sequence structure alignment
Ribonucleic acid (RNA) is a polymer composed of four bases denoted A, C, G, and U. It is a generally single-stranded molecule where the bases form hydrogen bonds within the same m...
Hans-Peter Lenhof, Knut Reinert, Martin Vingron
COMGEO
2008
ACM
13 years 7 months ago
Recursive geometry of the flow complex and topology of the flow complex filtration
The flow complex is a geometric structure, similar to the Delaunay tessellation, to organize a set of (weighted) points in Rk. Flow shapes are topological spaces corresponding to ...
Kevin Buchin, Tamal K. Dey, Joachim Giesen, Matthi...
CORR
2006
Springer
87views Education» more  CORR 2006»
13 years 7 months ago
Pseudorandomness and Combinatorial Constructions
Abstract. In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constr...
Luca Trevisan
CVPR
2005
IEEE
14 years 9 months ago
Estimating Disparity and Occlusions in Stereo Video Sequences
We propose an algorithm for estimating disparity and occlusion in stereo video sequences. The algorithm defines a prior on sequences of disparity maps using a 3D Markov random fie...
Oliver M. C. Williams, Michael Isard, John MacCorm...