Sciweavers

874 search results - page 19 / 175
» Faster Algorithms for Semi-Matching Problems
Sort
View
FOCS
2009
IEEE
14 years 2 months ago
Faster Generation of Random Spanning Trees
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
Jonathan A. Kelner, Aleksander Madry
ICIP
2007
IEEE
14 years 1 months ago
Sparse Gradient Image Reconstruction Done Faster
In a wide variety of imaging applications (especially medical imaging), we obtain a partial set or subset of the Fourier transform of an image. From these Fourier measurements, we...
Ray Maleh, Anna C. Gilbert, Martin J. Strauss
CVPR
2009
IEEE
14 years 2 months ago
Optimal scanning for faster object detection
Recent years have seen the development of fast and accurate algorithms for detecting objects in images. However, as the size of the scene grows, so do the running-times of these a...
Nicholas J. Butko, Javier R. Movellan
CCA
2009
Springer
14 years 6 days ago
From Interval Computations to Constraint-Related Set Computations: Towards Faster Estimation of Statistics and ODEs under Interv
Interval computations estimate the uncertainty of the result of data processing in situations in which we only know the upper bounds ∆ on the measurement errors. In this case, ba...
Vladik Kreinovich
CAGD
2005
112views more  CAGD 2005»
13 years 7 months ago
A second order algorithm for orthogonal projection onto curves and surfaces
In this paper we analyze an algorithm which solves the point projection and the "inversion" problems for parametric curves and surfaces. It consists of a geometric secon...
Shi-Min Hu, Johannes Wallner