4926 search results - page 160 / 986 » Two Graph Algorithms On an Associative Computing Model |
140
click to vote
EMNLP
2009
15 years 2 months ago
2009
We present an inexact search algorithm for the problem of predicting a two-layered dependency graph. The algorithm is based on a k-best version of the standard cubictime search al...
130
Voted
ICCSA
2010
Springer
15 years 7 months ago
2010
Springer
This paper achieves O(n3 log log n/ log n) time for the 2center problems on a directed graph with non-negative edge costs under the conventional RAM model where only arithmetic ope...
128
Voted
IPPS
1999
IEEE
15 years 9 months ago
1999
IEEE
Run-time support for the CYCLIC(k) redistribution on the SPMD computation model is presently very relevant for the scientific community. This work is focused to the characterizati...
147
Voted
ESA
2006
Springer
15 years 8 months ago
2006
Springer
We consider the following vertex coloring problem. We are given an undirected graph G = (V, E), where each vertex v is associated with a penalty rejection cost rv. We need to choos...
140
click to vote
CW
2002
IEEE
15 years 10 months ago
2002
IEEE
Metamorphosis between 3D objects is often the transformation between a pair of shapes that have the same topology. This paper presents a new model using Reeb graphs and their cont...