Sciweavers

6365 search results - page 99 / 1273
» Fast Local Computation Algorithms
Sort
View
FOCS
2006
IEEE
15 years 8 months ago
Fast Algorithms for Logconcave Functions: Sampling, Rounding, Integration and Optimization
We prove that the hit-and-run random walk is rapidly mixing for an arbitrary logconcave distribution starting from any point in the support. This extends the work of [26], where t...
László Lovász, Santosh Vempal...
132
Voted
ICIP
2003
IEEE
16 years 4 months ago
An adaptive multigrid algorithm for region of interest diffuse optical tomography
Dueto diffuse nature of lightphotons, Diffuse Optical Tomography (DOT) image reconstruction is a challenging 3D problem with a relatively large number of unknowns and limited meas...
Murat Guven, Birsen Yazici, Xavier Intes, Britton ...
PR
2006
122views more  PR 2006»
15 years 2 months ago
Fast multiscale clustering and manifold identification
We present a novel multiscale clustering algorithm inspired by algebraic multigrid techniques. Our method begins with assembling data points according to local similarities. It us...
Dan Kushnir, Meirav Galun, Achi Brandt
AUTOID
2005
IEEE
15 years 8 months ago
A Fast Algorithm for ICP-Based 3D Shape Biometrics
In a biometrics scenario, gallery images are enrolled into the database ahead of the matching step, which gives us the opportunity to build related data structures before the prob...
Ping Yan, Kevin W. Bowyer
ICPR
2010
IEEE
15 years 2 months ago
A Constant Average Time Algorithm to Allow Insertions in the LAESA Fast Nearest Neighbour Search Index
Abstract—Nearest Neighbour search is a widely used technique in Pattern Recognition. In order to speed up the search many indexing techniques have been proposed. However, most of...
Luisa Micó, José Oncina