Sciweavers

97 search results - page 9 / 20
» Approximate center points with proofs
Sort
View
SODA
2001
ACM
87views Algorithms» more  SODA 2001»
13 years 9 months ago
Steiner points in tree metrics don't (really) help
Consider an edge-weighted tree T = (V, E, w : E R+ ), in which a subset R of the nodes (called the required nodes) are colored red and the remaining nodes in S = V \R are colored ...
Anupam Gupta
FGR
2004
IEEE
170views Biometrics» more  FGR 2004»
13 years 11 months ago
3D Shape Constraint for Facial Feature Localization Using Probabilistic-like Output
This paper presents a method to automatically locate facial feature points under large variations in pose, illumination and facial expressions. First we propose a method to calcul...
Longbin Chen, Lei Zhang, HongJiang Zhang, Mohamed ...
TKDE
2008
162views more  TKDE 2008»
13 years 7 months ago
Continuous k-Means Monitoring over Moving Objects
Given a dataset P, a k-means query returns k points in space (called centers), such that the average squared distance between each point in P and its nearest center is minimized. S...
Zhenjie Zhang, Yin Yang, Anthony K. H. Tung, Dimit...
ENTCS
2008
91views more  ENTCS 2008»
13 years 7 months ago
Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra
Several different uses of Newton's method in connection with the Fundamental Theorem of Algebra are pointed out. Theoretical subdivision schemes have been combined with the n...
Prashant Batra
TCC
2007
Springer
100views Cryptology» more  TCC 2007»
14 years 1 months ago
Private Approximation of Clustering and Vertex Cover
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
Amos Beimel, Renen Hallak, Kobbi Nissim