Sciweavers

1425 search results - page 93 / 285
» Beyond Dependency Graphs
Sort
View
WEBI
2005
Springer
14 years 1 months ago
WICER: A Weighted Inter-Cluster Edge Ranking for Clustered Graphs
Several algorithms based on link analysis have been developed to measure the importance of nodes on a graph such as pages on the World Wide Web. PageRank and HITS are the most pop...
Divya Padmanabhan, Prasanna Kumar Desikan, Jaideep...
PC
2010
177views Management» more  PC 2010»
13 years 6 months ago
Parallel graph component labelling with GPUs and CUDA
Graph component labelling, which is a subset of the general graph colouring problem, is a computationally expensive operation that is of importance in many applications and simula...
Kenneth A. Hawick, Arno Leist, Daniel P. Playne
CSLP
2004
Springer
13 years 12 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
IJVR
2008
166views more  IJVR 2008»
13 years 8 months 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
STACS
2009
Springer
14 years 2 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, ...