Sciweavers

3874 search results - page 564 / 775
» Approximation Algorithms for k-hurdle Problems
Sort
View
MMNS
2003
119views Multimedia» more  MMNS 2003»
15 years 5 months ago
A New Available Bandwidth Measurement Technique for Service Overlay Networks
Abstract. We introduce a new measurement algorithm for the available bandwidth in a network path between two endhosts. This algorithm is an adaptation from existing active measurem...
Cao Le Thanh Man, Go Hasegawa, Masayuki Murata
CORR
2010
Springer
92views Education» more  CORR 2010»
15 years 4 months ago
Exact counting of Euler Tours for generalized series-parallel graphs
We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm...
Prasad Chebolu, Mary Cryan, Russell A. Martin
153
Voted
CVPR
2004
IEEE
16 years 6 months ago
Window-Based, Discontinuity Preserving Stereo
Traditionally, the problem of stereo matching has been addressed either by a local window-based approach or a dense pixel-based approach using global optimization. In this paper, ...
Motilal Agrawal, Larry S. Davis
144
Voted
ECCV
2008
Springer
16 years 6 months ago
Online Sparse Matrix Gaussian Process Regression and Vision Applications
We present a new Gaussian Process inference algorithm, called Online Sparse Matrix Gaussian Processes (OSMGP), and demonstrate its merits with a few vision applications. The OSMGP ...
Ananth Ranganathan, Ming-Hsuan Yang
MOC
2011
14 years 11 months ago
An optimal adaptive mixed finite element method
Abstract. Various applications in uid dynamics and computational continuum mechanics motivate the development of reliable and ecient adaptive algorithms for mixed nite element m...
Carsten Carstensen, Hella Rabus