Sciweavers

1810 search results - page 236 / 362
» Similarity estimation techniques from rounding algorithms
Sort
View
FOCS
2008
IEEE
15 years 4 months ago
Set Covering with our Eyes Closed
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi,...
ECCV
2004
Springer
16 years 5 months ago
Line Geometry for 3D Shape Understanding and Reconstruction
We understand and reconstruct special surfaces from 3D data with line geometry methods. Based on estimated surface normals we use approximation techniques in line space to recogniz...
Helmut Pottmann, Michael Hofer, Boris Odehnal, Joh...
ICIAP
2007
ACM
15 years 10 months ago
Robust Face Matching Under Large Occlusions
Outliers due to occlusions and contrast and offset signal deviations notably hinder recognition and retrieval of facial images. We propose a new maximum likelihood matching score ...
Georgy L. Gimel'farb, Patrice Delmas, John Morris,...
3DPVT
2006
IEEE
295views Visualization» more  3DPVT 2006»
15 years 5 months ago
Efficient Sparse 3D Reconstruction by Space Sweeping
This paper introduces a feature based method for the fast generation of sparse 3D point clouds from multiple images with known pose. We extract sub-pixel edge elements (2D positio...
Joachim Bauer, Christopher Zach, Horst Bischof
ICSE
2008
IEEE-ACM
16 years 3 months ago
Creating a cognitive metric of programming task difficulty
Conducting controlled experiments about programming activities often requires the use of multiple tasks of similar difficulty. In previously reported work about a controlled exper...
Brian de Alwis, Gail C. Murphy, Shawn Minto