Sciweavers

3341 search results - page 454 / 669
» On Bounded Queries and Approximation
Sort
View
SSDBM
2010
IEEE
133views Database» more  SSDBM 2010»
15 years 4 months ago
PrefIndex: An Efficient Supergraph Containment Search Technique
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
Gaoping Zhu, Xuemin Lin, Wenjie Zhang, Wei Wang, H...
CVPR
2001
IEEE
16 years 8 months ago
Tracking and Modeling Non-Rigid Objects with Rank Constraints
This paper presents a novel solution for flow-based tracking and 3D reconstruction of deforming objects in monocular image sequences. A non-rigid 3D object undergoing rotation and...
Lorenzo Torresani, Danny B. Yang, Eugene J. Alexan...
ICPR
2000
IEEE
16 years 7 months ago
Stability Analysis of Medial Axis Transform under Relative Hausdorff Distance
Medial axis transform (MAT) is a basic tool for shape analysis. But, in spite of its usefulness, it has some drawbacks, one of which is its instability under the boundary perturba...
Sung Woo Choi, Seong-Whan Lee
STOC
2001
ACM
111views Algorithms» more  STOC 2001»
16 years 6 months ago
Optimal outlier removal in high-dimensional
We study the problem of finding an outlier-free subset of a set of points (or a probability distribution) in n-dimensional Euclidean space. As in [BFKV 99], a point x is defined t...
John Dunagan, Santosh Vempala
STOC
2001
ACM
134views Algorithms» more  STOC 2001»
16 years 6 months ago
Fully-dynamic min-cut
We show that we can maintain up to polylogarithmic edge connectivity for a fully-dynamic graph in ~O(pn) time per edge insertion or deletion. Within logarithmic factors, this matc...
Mikkel Thorup