Sciweavers

776 search results - page 30 / 156
» Generalized Voxel Coloring
Sort
View
PODC
2006
ACM
15 years 7 months ago
On the complexity of distributed graph coloring
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
Fabian Kuhn, Roger Wattenhofer
MICCAI
2001
Springer
15 years 6 months ago
Segmentation of Dynamic N-D Data Sets via Graph Cuts Using Markov Models
Abstract. This paper describes a new segmentation technique for multidimensional dynamic data. One example of such data is a perfusion sequence where a number of 3D MRI volumes sho...
Yuri Boykov, Vivian S. Lee, Henry Rusinek, Ravi Ba...
CGF
2008
201views more  CGF 2008»
15 years 2 months ago
High-Resolution Volumetric Computation of Offset Surfaces with Feature Preservation
We present a new algorithm for the efficient and reliable generation of offset surfaces for polygonal meshes. The algorithm is robust with respect to degenerate configurations and...
Darko Pavic, Leif Kobbelt
CHI
2004
ACM
16 years 2 months ago
Link colors guide a search
While much basic research exists on the effects of various visual properties on visual search, the application of such research to real-world tasks is lacking. The purpose of this...
Tim Halverson, Anthony J. Hornof
107
Voted
ALGORITHMICA
2010
115views more  ALGORITHMICA 2010»
15 years 1 months ago
Multi-Color Pebble Motion on Graphs
We consider a graph with n vertices, and p < n pebbles of m colors. A pebble move consists of transferring a pebble from its current host vertex to an adjacent unoccupied verte...
Gilad Goraly, Refael Hassin