1161 search results - page 74 / 233 » Kinetic Dependence Graphs |
154
click to vote
CSLP
2004
Springer
15 years 10 months ago
2004
Springer
Many tasks in computational linguistics can be regarded as configuration problems. In this paper, we introduce the notion of lexicalised multi-dimensional configuration problems (l...
164
click to vote
IJVR
2008
15 years 6 months ago
2008
Augmented Reality (AR) enables users to visualize synthetic information overlaid on a real video stream. Such visualization is achieved by tools that vary depending on the underlyi...
170
click to vote
STACS
2009
Springer
16 years 1 months ago
2009
Springer
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted ...
197
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
176
click to vote
AAAI
2008
15 years 8 months ago
2008
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...