Sciweavers

723 search results - page 19 / 145
» On the hyperbolicity constant in graphs
Sort
View
STOC
2006
ACM
168views Algorithms» more  STOC 2006»
14 years 11 months ago
A combinatorial characterization of the testable graph properties: it's all about regularity
A common thread in all the recent results concerning the testing of dense graphs is the use of Szemer?edi's regularity lemma. In this paper we show that in some sense this is...
Noga Alon, Eldar Fischer, Ilan Newman, Asaf Shapir...
ECCV
2008
Springer
15 years 22 days 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
CVPR
1997
IEEE
14 years 3 months ago
Area and Length Minimizing Flows for Shape Segmentation
— A number of active contour models have been proposed that unify the curve evolution framework with classical energy minimization techniques for segmentation, such as snakes. Th...
Kaleem Siddiqi, Steven W. Zucker, Yves Béru...
SIAMMA
2010
81views more  SIAMMA 2010»
13 years 5 months ago
Heteroclinic Travelling Waves in Convex FPU-Type Chains
We consider infinite FPU-type atomic chains with general convex potentials and study the existence of monotone fronts that are heteroclinic travelling waves connecting constant asy...
Michael Herrmann, Jens D. M. Rademacher
DCOSS
2008
Springer
14 years 19 days ago
Local PTAS for Independent Set and Vertex Cover in Location Aware Unit Disk Graphs
We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...
Andreas Wiese, Evangelos Kranakis