1664 search results - page 155 / 333 » Distance labeling in graphs |
100
click to vote
ICPR
2004
IEEE
16 years 5 months ago
2004
IEEE
A systematic static shadow detection algorithm for color images is presented in this paper. The image is modeled by an undirected graph and the shadow detection is achieved throug...
114
click to vote
CPM
2004
Springer
15 years 10 months ago
2004
Springer
We describe a new technique for reducing the number of nodes and symbols in automata based on tries. The technique stems from some results on anti-dictionaries for data compression...
166
click to vote
AAIM
2007
Springer
15 years 8 months ago
2007
Springer
Given an acyclic directed graph and two distinct nodes s and t, we consider the problem of finding k disjoint paths from s to t satisfying some objective. We consider four objectiv...
121
click to vote
EMNLP
2007
15 years 6 months ago
2007
Shallow semantic parsing, the automatic identification and labeling of sentential constituents, has recently received much attention. Our work examines whether semantic role info...
149
click to vote
ECML
2004
Springer
15 years 10 months ago
2004
Springer
This work presents a novel procedure for computing (1) distances between nodes of a weighted, undirected, graph, called the Euclidean Commute Time Distance (ECTD), and (2) a subspa...