1172 search results - page 168 / 235 » Path Algorithms on Regular Graphs |
NAACL
2007
15 years 3 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...
105
click to vote
IROS
2007
IEEE
15 years 8 months ago
2007
IEEE
Abstract— We present an efficient algorithm for complete motion planning that combines approximate cell decomposition (ACD) with probabilistic roadmaps (PRM). Our approach uses ...
107
click to vote
KAIS
2010
15 years 12 days ago
2010
In systems of interacting entities such as social networks, interactions that occur regularly typically correspond to significant, yet often infrequent and hard to detect, interact...
117
click to vote
SPAA
2005
ACM
15 years 7 months ago
2005
ACM
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...
131
click to vote
PDP
2003
IEEE
15 years 7 months ago
2003
IEEE
We consider the execution of a complex application on a heterogeneous "grid" computing platform. The complex application consists of a suite of identical, independent pr...