1201 search results - page 141 / 241 » Linear Probing and Graphs |
150
click to vote
TSP
2008
15 years 4 months ago
2008
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...
133
click to vote
COMGEO
2004
ACM
15 years 4 months ago
2004
ACM
We introduce a novel technique for drawing proximity graphs in polynomial area and volume. Previously known algorithms produce representations whose size increases exponentially w...
150
click to vote
CAD
2000
Springer
15 years 4 months ago
2000
Springer
This paper presents a novel methodology for deriving the dynamic equations of mechatronic systems from component models that are represented as linear graphs. This work is part of...
126
click to vote
CORR
2000
Springer
15 years 4 months ago
2000
Springer
We describe a formal model for annotating linguistic artifacts, from which we derive an application programming interface (API) to a tools for manipulating these annotations. The ...
151
click to vote
JUCS
2002
15 years 4 months ago
2002
: Let G = (V, E) be a strongly connected and aperiodic directed graph of uniform out-degree k. A deterministic finite automaton is obtained if the edges are colored with k colors i...