Sciweavers

636 search results - page 85 / 128
» Deep Structure from a Geometric Point of View
Sort
View
164
Voted
DCG
2010
289views more  DCG 2010»
15 years 1 months ago
Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces
We consider the well known geometric problem of determining shortest paths between pairs of points on a polyhedral surface P, where P consists of triangular faces with positive we...
Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil...
CSL
2010
Springer
15 years 1 months ago
Randomisation and Derandomisation in Descriptive Complexity Theory
We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic ...
Kord Eickmeyer, Martin Grohe
109
Voted
CVPR
2004
IEEE
16 years 3 months ago
The World in an Eye
This paper provides a comprehensive analysis of exactly what visual information about the world is embedded within a single image of an eye. It turns out that the cornea of an eye...
Ko Nishino, Shree K. Nayar
SMI
2006
IEEE
135views Image Analysis» more  SMI 2006»
15 years 7 months ago
Laplace-Beltrami Eigenfunctions Towards an Algorithm That "Understands" Geometry
One of the challenges in geometry processing is to automatically reconstruct a higher-level representation from raw geometric data. For instance, computing a parameterization of a...
Bruno Lévy
VMV
2004
80views Visualization» more  VMV 2004»
15 years 3 months ago
Memory Efficient Billboard Clouds for BTF Textured Objects
Efficiently rendering highly structured models distant from the viewer constitutes a difficult task since the geometric complexity has to be reduced extremely while simultaneously...
Jan Meseth, Reinhard Klein