Sciweavers

5372 search results - page 85 / 1075
» complexity 2007
Sort
View
ISMAR
2007
IEEE
14 years 2 months ago
Retexturing in the Presence of Complex Illumination and Occlusions
We present a non-rigid registration technique that achieves spatial, photometric, and visibility accuracy. It lets us photo-realistically augment 3D deformable surfaces under comp...
Julien Pilet, Vincent Lepetit, Pascal Fua
STOC
2007
ACM
108views Algorithms» more  STOC 2007»
14 years 8 months ago
Combinatorial complexity in O-minimal geometry
In this paper we prove tight bounds on the combinatorial and topological complexity of sets defined in terms of n definable sets belonging to some fixed definable family of sets i...
Saugata Basu
IJCGA
2007
44views more  IJCGA 2007»
13 years 7 months ago
On the Expected Size of the 2D Visibility Complex
We study the expected size of the 2D visibility complex of randomly distributed objects in the plane. We prove that the asymptotic expected number of free bitangents (which corres...
Hazel Everett, Sylvain Lazard, Sylvain Petitjean, ...
ICIP
2007
IEEE
14 years 9 months ago
Using Phase and Magnitude Information of the Complex Directional Filter Bank for Texture Image Retrieval
This paper discusses how to utilize both magnitude and phase information obtained from the complex directional lter bank (CDFB) for the purpose of texture image retrieval. The rel...
An P. N. Vo, Soontorn Oraintara, Truong T. Nguyen
MFCS
2007
Springer
14 years 1 months ago
On the Complexity of Computing Treelength
We resolve the computational complexity of determining the treelength of a graph, thereby solving an open problem of Dourisboure and Gavoille, who introduced this parameter, and a...
Daniel Lokshtanov