1986 search results - page 246 / 398 » Path Separability of Graphs |
159
click to vote
ICRA
2007
IEEE
15 years 9 months ago
2007
IEEE
Abstract— This paper presents a solution to interactive navigation planning and real-time simulation of a very large number of entities moving in a virtual environment. From the ...
125
Voted
FQAS
2006
Springer
15 years 7 months ago
2006
Springer
We present a functional model for the analysis of large volumes of detailed transactional data, accumulated over time. In our model, the data schema is an acyclic graph with a sing...
134
click to vote
STACS
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. Block codes are first viewed as finite state automata represented as trellises. A technique termed subtrellis overlaying is introduced with the object of reducing decoder...
113
click to vote
NAACL
2007
15 years 5 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...
174
Voted
ACID
2006
15 years 5 months ago
2006
In a congestion game, several players simultaneously aim at allocating sets of resources, e.g., each player aims at allocating a shortest path between a source/destination pair in ...