Sciweavers

1594 search results - page 75 / 319
» An Algorithm to Compute Collusion Paths
Sort
View
ICCV
2005
IEEE
16 years 5 months ago
A Theory of Refractive and Specular 3D Shape by Light-Path Triangulation
We investigate the feasibility of reconstructing an arbitrarily-shaped specular scene (refractive or mirror-like) from one or more viewpoints. By reducing shape recovery to the pr...
Kiriakos N. Kutulakos, Eron Steger
TROB
2008
97views more  TROB 2008»
15 years 2 months ago
Physical Path Planning Using a Pervasive Embedded Network
Abstract--We evaluate a technique that uses an embedded network deployed pervasively throughout an environment to aid robots in navigation. The embedded nodes do not know their abs...
Keith J. O'Hara, Daniel B. Walker, Tucker R. Balch
CAD
2004
Springer
15 years 2 months ago
Reduce the stretch in surface flattening by finding cutting paths to the surface boundary
This paper presents a method for finding cutting paths on a 3D triangular mesh surface to reduce the stretch in the flattened surface. The cutting paths link the surface boundary ...
Charlie C. L. Wang, Yu Wang 0010, Kai Tang, Matthe...
SPAA
2004
ACM
15 years 8 months ago
Cache-oblivious shortest paths in graphs using buffer heap
We present the Buffer Heap (BH), a cache-oblivious priority queue that supports Delete-Min, Delete, and Decrease-Key operations in O( 1 B log2 N B ) amortized block transfers fro...
Rezaul Alam Chowdhury, Vijaya Ramachandran
IWPEC
2004
Springer
15 years 8 months ago
Perfect Path Phylogeny Haplotyping with Missing Data Is Fixed-Parameter Tractable
Abstract. Haplotyping via perfect phylogeny is a method for retrieving haplotypes from genotypes. Fast algorithms are known for computing perfect phylogenies from complete and erro...
Jens Gramm, Till Nierhoff, Till Tantau