Sciweavers

4911 search results - page 619 / 983
» Tree dependence analysis
Sort
View
ISAAC
2005
Springer
127views Algorithms» more  ISAAC 2005»
15 years 10 months ago
Decision Making Based on Approximate and Smoothed Pareto Curves
Abstract. We consider bicriteria optimization problems and investigate the relationship between two standard approaches to solving them: (i) computing the Pareto curve and (ii) the...
Heiner Ackermann, Alantha Newman, Heiko Rögli...
MMDB
2004
ACM
151views Multimedia» more  MMDB 2004»
15 years 9 months ago
Indexing of variable length multi-attribute motion data
Haptic data such as 3D motion capture data and sign language animation data are new forms of multimedia data. The motion data is multi-attribute, and indexing of multiattribute da...
Chuanjun Li, Gaurav N. Pradhan, Si-Qing Zheng, B. ...
VRST
2003
ACM
15 years 9 months ago
Time-critical collision detection using an average-case approach
We present a novel, generic framework and algorithm for hierarchical collision detection, which allows an application to balance speed and quality of the collision detection. We p...
Jan Klein, Gabriel Zachmann
STOC
1996
ACM
115views Algorithms» more  STOC 1996»
15 years 8 months ago
Minimum Cuts in Near-Linear Time
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
David R. Karger
STACS
1992
Springer
15 years 8 months ago
Speeding Up Two String-Matching Algorithms
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
Maxime Crochemore, Thierry Lecroq, Artur Czumaj, L...