516 search results - page 74 / 104 » Generalizing the Discrete Timed Automaton |
154
click to vote
STOC
2009
ACM
16 years 6 months ago
2009
ACM
We consider the stochastic Steiner forest problem: suppose we were given a collection of Steiner forest instances, and were guaranteed that a random one of these instances would a...
166
click to vote
RECOMB
2003
Springer
16 years 6 months ago
2003
Springer
Genetic linkage analysis is a challenging application which requires Bayesian networks consisting of thousands of vertices. Consequently, computing the likelihood of data, which i...
161
click to vote
PODC
2006
ACM
15 years 12 months ago
2006
ACM
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
161
click to vote
COMPGEOM
2009
ACM
15 years 10 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....
153
click to vote
SIGGRAPH
1994
ACM
15 years 10 months ago
1994
ACM
Specifying the motion of an animated linked figure such that it achieves given tasks (e.g., throwing a ball into a basket) and performs the tasks in a realistic fashion (e.g., gra...