3804 search results - page 241 / 761 » From Here to There |
147
click to vote
COMBINATORICS
2004
15 years 6 months ago
2004
Until now, the enumeration of connected graphs has been dealt with by probabilistic methods, by special combinatorial decompositions or by somewhat indirect formal series manipula...
167
click to vote
CONNECTION
2004
15 years 6 months ago
2004
An astronomical set of sentences can be produced in natural language by combining relatively simple sentence structures with a human-size lexicon. These sentences are within the ra...
121
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
Often adaptive, distributed control can be viewed as an iterated game between independent players. The coupling between the players' mixed strategies, arising as the system ev...
177
click to vote
ALGORITHMICA
2000
15 years 6 months ago
2000
We present an O(NV +V 3) time algorithm for enumerating all spanning trees of a directed graph. This improves the previous best known bound of O(NE + V + E) [1] when V 2 = o(N), wh...
137
click to vote
CGF
2000
15 years 6 months ago
2000
espace interpolation algorithm abstracts motion sequences as 1D signals, and interpolates between them to create higher dimension signals, with weights drawn from a user specified...