Sciweavers

1664 search results - page 133 / 333
» Distance labeling in graphs
Sort
View
ORL
2008
99views more  ORL 2008»
15 years 4 months ago
Some tractable instances of interval data minmax regret problems
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particul...
Bruno Escoffier, Jérôme Monnot, Olivi...
ICIP
2007
IEEE
16 years 6 months ago
Distancecut: Interactive Segmentation and Matting of Images and Videos
An interactive algorithm for soft segmentation and matting of natural images and videos is presented in this paper. The technique follows and extends [10], where the user first ro...
Xue Bai, Guillermo Sapiro
VLDB
2005
ACM
104views Database» more  VLDB 2005»
15 years 10 months ago
Approximate Matching of Hierarchical Data Using pq-Grams
When integrating data from autonomous sources, exact matches of data items that represent the same real world object often fail due to a lack of common keys. Yet in many cases str...
Nikolaus Augsten, Michael H. Böhlen, Johann G...
ICASSP
2011
IEEE
14 years 8 months ago
Similarity learning for semi-supervised multi-class boosting
In semi-supervised classification boosting, a similarity measure is demanded in order to measure the distance between samples (both labeled and unlabeled). However, most of the e...
Q. Y. Wang, Pong Chi Yuen, Guo-Can Feng
WG
2005
Springer
15 years 10 months ago
Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time
Broadcast domination was introduced by Erwin in 2002, and it is a variant of the standard dominating set problem, such that vertices can be assigned various domination powers. Broa...
Pinar Heggernes, Daniel Lokshtanov