2294 search results - page 158 / 459 » From Path Graphs to Directed Path Graphs |
MOBIHOC
2005
ACM
15 years 9 months ago
2005
ACM
Location information is very useful in the design of sensor network infrastructures. In this paper, we study the anchor-free 2D localization problem by using local angle measureme...
CPM
2001
Springer
15 years 2 months ago
2001
Springer
Directed Acyclic Word Graph (DAWG) is a space efficient data structure that supports indices of a string. Compact Directed Acyclic Word Graph (CDAWG) is a more space efficient vari...
GD
2006
Springer
15 years 1 months ago
2006
Springer
We prove that computing a geometric minimum-dilation graph on a given set of points in the plane, using not more than a given number of edges, is an NP-hard problem, no matter if ...
JCO
2007
14 years 10 months ago
2007
Abstract The wide diameter of a graph is an important parameter to measure faulttolerance of interconnection network. This paper proves that for any two vertices in de Bruijn undir...
NAACL
2007
14 years 11 months ago
2007
This paper describes an efficient method to extract large n-best lists from a word graph produced by a statistical machine translation system. The extraction is based on the k sh...