1805 search results - page 261 / 361 » Functional programming with structured graphs |
122
click to vote
ADBIS
2003
Springer
15 years 7 months ago
2003
Springer
Let a tuple of n objects obeying a query graph (QG) be called the n-tuple. The “Ddistance-value” of this n-tuple is the value of a linear function of distances of the n objects...
119
click to vote
PPSN
1992
Springer
15 years 6 months ago
1992
Springer
This paper introduces a new optimization technique called hyperplane annealing. It is similar to the mean field annealing approach to combinatorial optimization. Both annealing te...
129
Voted
LREC
2010
15 years 3 months ago
2010
The phenomenon of coreference, covering entities, their mentions and their properties, is intricately linked to the phenomenon of coherence, covering the structure of rhetorical r...
115
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
115
click to vote
ENTCS
2010
15 years 2 months ago
2010
Process modeling languages such as "Dynamical Grammars" are highly expressive in the processes they model using stochastic and deterministic dynamical systems, and can b...