603 search results - page 35 / 121 » A General Approximation Technique for Constrained Forest Pro... |
97
Voted
WEA
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. Extensions of the randomized tournaments techniques introduced in [6, 7] to approximate solutions of 1-median and diameter computation of finite subsets of general metri...
112
click to vote
CVPR
1998
IEEE
16 years 3 months ago
1998
IEEE
Markov Random Fields (MRF's) can be used for a wide variety of vision problems. In this paper we focus on MRF's with two-valued clique potentials, which form a generaliz...
120
click to vote
CORR
2010
Springer
15 years 2 days ago
2010
Springer
Abstract—This paper studies the problem of distributed computation over a network of wireless sensors. While this problem applies to many emerging applications, to keep our discu...
98
Voted
IPPS
2006
IEEE
15 years 7 months ago
2006
IEEE
Applications for constrained embedded systems are subject to strict time constraints and restrictive resource utilization. With soft core processors, application developers can cu...
119
click to vote
STOC
2003
ACM
16 years 1 months ago
2003
ACM
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...