Sciweavers

221 search results - page 12 / 45
» The cost of not knowing the radius
Sort
View
3DIM
2007
IEEE
13 years 11 months ago
Examplar-based Shape from Shading
Traditional Shape-from-Shading (SFS) techniques aim to solve an under-constrained problem: estimating depth map from one single image. The results are usually brittle from real im...
Xinyu Huang, Jizhou Gao, Liang Wang, Ruigang Yang
APPROX
2008
Springer
101views Algorithms» more  APPROX 2008»
13 years 9 months ago
Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity
Clustering is a common problem in the analysis of large data sets. Streaming algorithms, which make a single pass over the data set using small working memory and produce a cluster...
Richard Matthew McCutchen, Samir Khuller
SIAMCOMP
2008
137views more  SIAMCOMP 2008»
13 years 7 months ago
Approximate Shortest Paths in Anisotropic Regions
Our goal is to find an approximate shortest path for a point robot moving in a planar subdivision with n vertices. Let 1 be a real number. Distances in each face of this subdivis...
Siu-Wing Cheng, Hyeon-Suk Na, Antoine Vigneron, Ya...
TCS
2008
13 years 7 months ago
Minimum-Energy Broadcast and disk cover in grid wireless networks
The Minimum-Energy Broadcast problem is to assign a transmission range to every station of an ad-hoc wireless networks so that (i) a given source station is allowed to perform bro...
Tiziana Calamoneri, Andrea E. F. Clementi, Miriam ...
ACSAC
2009
IEEE
14 years 2 months ago
Privacy through Noise: A Design Space for Private Identification
To protect privacy in large systems, users must be able to authenticate against a central server without disclosing their identity to the network. Private identification protocols ...
Karsten Nohl, David Evans