557 search results - page 47 / 112 » Visualizing Weighted Edges in Graphs |
SODA
2000
ACM
15 years 13 days ago
2000
ACM
The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices terminals. We present a new polynomial-time heurist...
101
click to vote
BMVC
2010
14 years 9 months ago
2010
Markov random field pixel labelling is often used to obtain image segmentations in which each segment or region is labelled according to its attributes such as colour or texture. ...
WISE
2000
Springer
15 years 3 months ago
2000
Springer
Web-based collaboration is becoming increasingly common. Often such collaboration exhibits emergent characteristics, for which systems based on a notion of workspaces provide suit...
JVCA
2006
14 years 11 months ago
2006
This paper presents a novel interactive mesh deformation method that can achieve various dynamic material effects, including elastic membrane and cloth effects. In our framework, ...
91
Voted
ICDAR
2011
IEEE
13 years 10 months ago
2011
IEEE
—We propose a novel method to evaluate table segmentation results based on a table image ground truther. In the ground-truthing process, we first extract connected components fr...