Sciweavers

1604 search results - page 72 / 321
» Approximation algorithms for developable surfaces
Sort
View
COMPGEOM
2006
ACM
14 years 2 months ago
Algorithms for two-box covering
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
Esther M. Arkin, Gill Barequet, Joseph S. B. Mitch...
ICASSP
2011
IEEE
13 years 20 days ago
Graphical models for localization of the seizure focus from interictal intracranial EEG
Decision algorithms are developed that use periods of intracranial non-seizure (interictal) EEG to localize epileptogenic networks. Depth and surface recordings are considered fro...
Justin Dauwels, Emad N. Eskandar, Andy Cole, Dan H...
CVPR
2003
IEEE
14 years 11 months ago
Visual Hull Alignment and Refinement Across Time: A 3D Reconstruction Algorithm Combining Shape-From-Silhouette with Stereo
Visual Hull (VH) construction from silhouette images is a popular method of shape estimation. The method, also known as Shape-From-Silhouette (SFS), is used in many applications s...
German K. M. Cheung, Simon Baker, Takeo Kanade
CVPR
2006
IEEE
14 years 3 months ago
Specular Flow and the Recovery of Surface Structure
In scenes containing specular objects, the image motion observed by a moving camera may be an intermixed combination of optical flow resulting from diffuse reflectance (diffuse ...
Stefan Roth, Michael J. Black
APPROX
2008
Springer
101views Algorithms» more  APPROX 2008»
13 years 11 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