Sciweavers

3204 search results - page 339 / 641
» The b-chromatic Number of a Graph
Sort
View
PAMI
2006
440views more  PAMI 2006»
15 years 6 months ago
Random Walks for Image Segmentation
Abstract-- A novel method is proposed for performing multilabel, interactive image segmentation. Given a small number of pixels with user-defined (or pre-defined) labels, one can a...
Leo Grady
TCS
2008
15 years 6 months ago
Digraph measures: Kelly decompositions, games, and orderings
We consider various well-known, equivalent complexity measures for graphs such as elimination orderings, k-trees and cops and robber games and study their natural translations to ...
Paul Hunter, Stephan Kreutzer
CAD
2005
Springer
15 years 6 months ago
Shape-based searching for product lifecycle applications
Estimates suggest that more than 75% of engineering design activity comprises reuse of previous design knowledge to address a new design problem. Reusing design knowledge has grea...
Natraj Iyer, Subramaniam Jayanti, Kuiyang Lou, Yag...
158
Voted
JCT
2007
85views more  JCT 2007»
15 years 6 months ago
Avoider-Enforcer games
In numerous positional games the identity of the winner is easily determined. In this case one of the more interesting questions is not who wins but rather how fast can one win. T...
Dan Hefetz, Michael Krivelevich, Tibor Szabó...
TOG
2008
137views more  TOG 2008»
15 years 6 months ago
Efficient traversal of mesh edges using adjacency primitives
Processing of mesh edges lies at the core of many advanced realtime rendering techniques, ranging from shadow and silhouette computations, to motion blur and fur rendering. We pre...
Pedro V. Sander, Diego Nehab, Eden Chlamtac, Hugue...