Sciweavers

42230 search results - page 164 / 8446
» Algorithms and Complexity Results for
Sort
View
CGI
1998
IEEE
15 years 10 months ago
Hierarchical Visibility Culling with Occlusion Trees
In the scope of rendering complex models with high depth complexity, it is of great importance to design outputsensitive algorithms, i.e., algorithms with the time complexity prop...
Jirí Bittner, Vlastimil Havran, Pavel Slav&...
WDAG
1997
Springer
106views Algorithms» more  WDAG 1997»
15 years 10 months ago
Performing Tasks on Restartable Message-Passing Processors
Abstract. This work presents new algorithms for the "Do-All" problem that consists of performing t tasks reliably in a message-passing synchronous system of p fault-prone...
Bogdan S. Chlebus, Roberto De Prisco, Alexander A....
WABI
2001
Springer
124views Bioinformatics» more  WABI 2001»
15 years 11 months ago
Computing Linking Numbers of a Filtration
We develop fast algorithms for computing the linking number of a simplicial complex within a filtration. We give experimental results in applying our work toward the detection of...
Herbert Edelsbrunner, Afra Zomorodian
KDD
2009
ACM
156views Data Mining» more  KDD 2009»
16 years 7 months ago
Query result clustering for object-level search
Query result clustering has recently attracted a lot of attention to provide users with a succinct overview of relevant results. However, little work has been done on organizing t...
Jongwuk Lee, Seung-won Hwang, Zaiqing Nie, Ji-Rong...
CVPR
2007
IEEE
16 years 8 months ago
ROI-SEG: Unsupervised Color Segmentation by Combining Differently Focused Sub Results
This paper presents a novel unsupervised color segmentation scheme named ROI-SEG, which is based on the main idea of combining a set of different sub-segmentation results. We prop...
Michael Donoser, Horst Bischof