982 search results - page 77 / 197 » Solving Steiner tree problems in graphs to optimality |
101
click to vote
IPSN
2005
Springer
15 years 6 months ago
2005
Springer
— Many inference problems that arise in sensor networks require the computation of a global conclusion that is consistent with local information known to each node. A large class...
95
Voted
AAAI
2004
15 years 2 months ago
2004
Combinatorial auctions (CAs) are important mechanisms for allocating interrelated items. Unfortunately, winner determination is NP-complete unless there is special structure. We s...
123
Voted
IPPS
2007
IEEE
15 years 7 months ago
2007
IEEE
In this paper, we study the problem of an optimal assignment of a tree-structured context reasoning procedure onto the computation resources in a hostsatellites configuration. The...
99
Voted
ICIP
2010
IEEE
14 years 10 months ago
2010
IEEE
We propose a two component method for denoising multidimensional signals, e.g. images. The first component uses a dynamic programing algorithm of complexity O(N log N) to find an ...
126
Voted
DC
2010
15 years 22 days ago
2010
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...