Sciweavers

32545 search results - page 505 / 6509
» Data Structures and Algorithms
Sort
View
WSCG
2003
143views more  WSCG 2003»
15 years 8 months ago
Fast Algorithm for Stochastic Tree Computation
In this paper, a recursive algorithm that can build complex tree structure quickly is presented briefly. The plant structural growth is based on a dual-scale automaton, in which ā...
Meng-Zhen Kang, Philippe de Reffye, Jean Fran&cced...
KDD
2004
ACM
137views Data Mining» more  KDD 2004»
16 years 13 days ago
Mining scale-free networks using geodesic clustering
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...
Andrew Y. Wu, Michael Garland, Jiawei Han
VLSM
2005
Springer
16 years 17 days ago
Heuristically Driven Front Propagation for Geodesic Paths Extraction
In this paper we present a simple modification of the Fast Marching algorithm to speed up the computation using a heuristic. This modification leads to an algorithm that is simil...
Gabriel Peyré, Laurent D. Cohen
VISUALIZATION
1998
IEEE
15 years 11 months ago
Interactive out-of-core isosurface extraction
In this paper, we present a novel out-of-core technique for the interactive computation of isosurfaces from volume data. Our algorithm minimizes the main memory and disk space req...
Yi-Jen Chiang, Cláudio T. Silva, William J....
EMMCVPR
2007
Springer
16 years 1 months ago
Bayesian Order-Adaptive Clustering for Video Segmentation
Video segmentation requires the partitioning of a series of images into groups that are both spatially coherent and smooth along the time axis. We formulate segmentation as a Bayes...
Peter Orbanz, Samuel Braendle, Joachim M. Buhmann