1884 search results - page 242 / 377 » Simple Algorithm for Simple Timed Games |
152
Voted
APPROX
2004
Springer
15 years 10 months ago
2004
Springer
Consider the following communication problem, that leads to a new notion of edge coloring. The communication network is represented by a bipartite multigraph, where the nodes on o...
162
Voted
HYBRID
2004
Springer
15 years 10 months ago
2004
Springer
We present a parameter inference algorithm for autonomous stochastic linear hybrid systems, which computes a maximum-likelihood model, given only a set of continuous output data of...
139
click to vote
COMPGEOM
2009
ACM
15 years 9 months ago
2009
ACM
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
122
click to vote
COCOON
2001
Springer
15 years 9 months ago
2001
Springer
A data structure called PC-tree is introduced as a generalization of PQ-trees. PC-trees were originally introduced in a planarity test of Shih and Hsu [7] where they represent par...
138
click to vote
WADS
2001
Springer
15 years 9 months ago
2001
Springer
Methods for ranking World Wide Web resources according to their position in the link structure of the Web are receiving considerable attention, because they provide the first e...