Sciweavers

181 search results - page 36 / 37
» Fast Approximate Graph Partitioning Algorithms
Sort
View
VRST
2003
ACM
13 years 10 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
ECCV
2008
Springer
14 years 7 months ago
Automatic Image Colorization Via Multimodal Predictions
We aim to color greyscale images automatically, without any manual intervention. The color proposition could then be interactively corrected by user-provided color landmarks if nec...
Bernhard Schölkopf, Guillaume Charpiat, Matth...
CIBCB
2006
IEEE
13 years 11 months ago
A Novel Graphical Model Approach to Segmenting Cell Images
— Successful biological image analysis usually requires satisfactory segmentations to identify regions of interest as an intermediate step. Here we present a novel graphical mode...
Shann-Ching Chen, Ting Zhao, Geoffrey J. Gordon, R...
SIGGRAPH
1999
ACM
13 years 9 months ago
Real-Time Acoustic Modeling for Distributed Virtual Environments
Realistic acoustic modeling is essential for spatializing sound in distributed virtual environments where multiple networked users move around and interact visually and aurally in...
Thomas A. Funkhouser, Patrick Min, Ingrid Carlbom
CIAC
2000
Springer
210views Algorithms» more  CIAC 2000»
13 years 9 months ago
Computing a Diameter-Constrained Minimum Spanning Tree in Parallel
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
Narsingh Deo, Ayman Abdalla