Sciweavers

2342 search results - page 258 / 469
» Sublinear geometric algorithms
Sort
View
124
Voted
APPROX
2008
Springer
83views Algorithms» more  APPROX 2008»
15 years 5 months ago
Sampling Hypersurfaces through Diffusion
Abstract. We are interested in efficient algorithms for generating random samples from geometric objects such as Riemannian manifolds. As a step in this direction, we consider the ...
Hariharan Narayanan, Partha Niyogi
157
Voted
WSCG
2004
145views more  WSCG 2004»
15 years 4 months ago
Efficient and Feature-Preserving Triangular Mesh Decimation
Most of the existing algorithms for decimation of triangular meshes perform poorly at very low levels of detail. We propose a new automatic method for the decimation of triangular...
Muhammad Hussain, Yoshihiro Okada, Koichi Niijima
168
Voted
GLOBECOM
2010
IEEE
15 years 26 days ago
Sensor Placement for Minimum Exposure in Distributed Active Sensing Networks
Distributed active sensing is a new sensing paradigm, where active sensors and passive sensors are distributed in a field, and collaboratively detect and track the objects. "E...
Na Xia, Khuong Vu, Rong Zheng
CVPR
2007
IEEE
16 years 5 months ago
On the Direct Estimation of the Fundamental Matrix
The fundamental matrix is a central construct in the analysis of images captured from a pair of cameras and many feature-based methods have been proposed for its computation. In t...
Yaser Sheikh, Asaad Hakeem, Mubarak Shah
126
Voted
CVPR
2008
IEEE
16 years 5 months ago
Clustering and dimensionality reduction on Riemannian manifolds
We propose a novel algorithm for clustering data sampled from multiple submanifolds of a Riemannian manifold. First, we learn a representation of the data using generalizations of...
Alvina Goh, René Vidal