186 search results - page 14 / 38 » Improved approximation algorithms for directed Steiner fores... |
INFOCOM
2005
IEEE
15 years 3 months ago
2005
IEEE
— We present decentralized algorithms that compute minimum-cost subgraphs for establishing multicast connections in networks that use coding. These algorithms, coupled with exist...
81
Voted
LICS
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper we introduce “clipping,” a new method of syntactic approximation which is motivated by and works in conjunction with a sound and decidable denotational model for...
WADS
2005
Springer
15 years 3 months ago
2005
Springer
We analyze the performance of simple algorithms for matching two planar point sets under rigid transformations so as to minimize the directed Hausdorff distance between the sets....
96
Voted
WABI
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. The orientation of physical networks is a prime task in deciphering the signaling-regulatory circuitry of the cell. One manifestation of this computational task is as a m...
ICML
2002
IEEE
15 years 10 months ago
2002
IEEE
One of the central challenges in reinforcement learning is to balance the exploration/exploitation tradeoff while scaling up to large problems. Although model-based reinforcement ...