2944 search results - page 133 / 589 » Improving Bound Propagation |
124
click to vote
AAAI
1998
15 years 5 months ago
1998
Temporal plans permit significant flexibility in specifying the occurrence time of events. Plan execution can make good use of that flexibility. However, the advantage of executio...
119
click to vote
ECCV
2006
Springer
16 years 6 months ago
2006
Springer
For fitting an ellipse to a point sequence, ML (maximum likelihood) has been regarded as having the highest accuracy. In this paper, we demonstrate the existence of a "hyperac...
135
click to vote
MFCS
2004
Springer
15 years 9 months ago
2004
Springer
We study the on-line versions of two fundamental graph problems, maximum independent set and minimum coloring, for the case of disk graphs which are graphs resulting from intersect...
115
click to vote
ICRA
1994
IEEE
15 years 8 months ago
1994
IEEE
This paper describes an efficient algorithm for computing the distance between non-convex objects. Objects are modeled as the union of a set of convex components. From this model ...
128
click to vote
APPROX
2007
Springer
15 years 8 months ago
2007
Springer
We show that the multi-commodity max-flow/min-cut gap for series-parallel graphs can be as bad as 2, matching a recent upper bound [8] for this class, and resolving one side of a ...