Sciweavers

1810 search results - page 183 / 362
» Similarity estimation techniques from rounding algorithms
Sort
View
ICASSP
2011
IEEE
13 years 2 days ago
Near-field array shape calibration
In the important domain of array shape calibration, the near-field case poses a challenging problem due to the array response complexity induced by the range effect. In this pape...
Shuang Wan, Pei-Jung Chung, Bernard Mulgrew
SDM
2003
SIAM
184views Data Mining» more  SDM 2003»
13 years 9 months ago
Finding Clusters of Different Sizes, Shapes, and Densities in Noisy, High Dimensional Data
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...
Levent Ertöz, Michael Steinbach, Vipin Kumar
ECCV
2008
Springer
14 years 10 months ago
Using Multiple Hypotheses to Improve Depth-Maps for Multi-View Stereo
We propose an algorithm to improve the quality of depth-maps used for Multi-View Stereo (MVS). Many existing MVS techniques make use of a two stage approach which estimates depth-m...
Carlos Hernández, George Vogiatzis, Neill D...
IROS
2007
IEEE
156views Robotics» more  IROS 2007»
14 years 2 months ago
Learning maps in 3D using attitude and noisy vision sensors
— In this paper, we address the problem of learning 3D maps of the environment using a cheap sensor setup which consists of two standard web cams and a low cost inertial measurem...
Bastian Steder, Giorgio Grisetti, Slawomir Grzonka...
INFOCOM
2011
IEEE
13 years 2 days ago
A distributed and privacy preserving algorithm for identifying information hubs in social networks
—This paper addresses the problem of identifying the top-k information hubs in a social network. Identifying topk information hubs is crucial for many applications such as advert...
Muhammad Usman Ilyas, Muhammad Zubair Shafiq, Alex...