10901 search results - page 346 / 2181 » Approximations in Distributed Optimization |
193
click to vote
GLOBECOM
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract--All-optical multicast routing (AOMR) is implemented by the concept of light-tree in WDM networks. The costoptimal multicast light-tree is NP-hard to compute, especially w...
188
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
Many problems in computer vision can be modeled using
conditional Markov random fields (CRF). Since finding
the maximum a posteriori (MAP) solution in such models
is NP-hard, mu...
281
click to vote
ICDE
2007
IEEE
16 years 8 months ago
2007
IEEE
Traditional approaches for efficiently processing historical queries, where a history is a multidimensional timeseries, employ a two step filter-and-refine scheme. In the filter s...
166
click to vote
STOC
2009
ACM
16 years 7 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...
180
click to vote
IPSN
2009
Springer
16 years 1 months ago
2009
Springer
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...