Sciweavers

6274 search results - page 277 / 1255
» From query complexity to computational complexity
Sort
View
146
Voted
PR
2007
125views more  PR 2007»
15 years 4 months ago
Calculating geometric properties of three-dimensional objects from the spherical harmonic representation
The volume, location of the centroid, and second order moments of a threedimensional star-shaped object are determined in terms of the spherical harmonic coefficients of its bound...
Artemy Baxansky, Nahum Kiryati
HCI
2009
15 years 2 months ago
The Pluses and Minuses of Obtaining Measurements from Digital Scans
Digital scanners are commonplace and are used in many different applications to obtain three-dimensional shapes and linear and circumferential measurements. Even though scanners ca...
Ravindra S. Goonetilleke, Channa P. Witana, Jianhu...
126
Voted
IH
2005
Springer
15 years 10 months ago
On the Intractability of Inverting Geometric Distortions in Watermarking Schemes
We examine the problem of watermarking schemes robust against geometric distortions from a complexity theoretic point of view. The main results presented are polynomial time reduct...
Maciej Liskiewicz, Ulrich Wölfel
154
Voted
COCO
2007
Springer
94views Algorithms» more  COCO 2007»
15 years 9 months ago
On Approximate Majority and Probabilistic Time
We prove new results on the circuit complexity of Approximate Majority, which is the problem of computing Majority of a given bit string whose fraction of 1's is bounded away...
Emanuele Viola
CVPR
1998
IEEE
16 years 7 months ago
Generation of the Euclidean Skeleton from the Vector Distance Map by a Bisector Decision Rule
The Euclidean skeleton is essential for general shape representation. This paper provides an e cient method to extract a well-connected Euclidean skeleton by a neighbor bisector d...
Hong Li, Albert M. Vossepoel