Sciweavers

1161 search results - page 74 / 233
» Kinetic Dependence Graphs
Sort
View
90
Voted
CSLP
2004
Springer
15 years 4 months ago
Multi-dimensional Graph Configuration for Natural Language Processing
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...
Ralph Debusmann, Denys Duchier, Marco Kuhlmann
88
Voted
IJVR
2008
166views more  IJVR 2008»
15 years 17 days ago
Context Sensitive Stylesheets for Scene Graphs
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...
Erick Méndez, Dieter Schmalstieg
100
Voted
STACS
2009
Springer
15 years 7 months ago
Hardness and Algorithms for Rainbow Connectivity
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 ...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah, ...
130
Voted
CORR
2008
Springer
118views Education» more  CORR 2008»
15 years 4 days ago
Decentralized Search with Random Costs
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...
Oskar Sandberg
107
Voted
AAAI
2008
15 years 2 months ago
Clustering via Random Walk Hitting Time on Directed Graphs
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...
Mo Chen, Jianzhuang Liu, Xiaoou Tang