815 search results - page 98 / 163 » Approximate Entropy Reducts |
ICALP
2010
Springer
15 years 4 months ago
2010
Springer
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
WWW
2003
ACM
16 years 16 days ago
2003
ACM
Since CDN simulations are known to be highly memory-intensive, in this paper, we argue the need for reducing the memory requirements of such simulations. We propose a novel memory...
INFOCOM
2008
IEEE
15 years 6 months ago
2008
IEEE
—The problem of minimum cost in-network fusion of measurements, collected from distributed sensors via multihop routing is considered. A designated fusion center performs an opti...
ALGOSENSORS
2007
Springer
15 years 6 months ago
2007
Springer
We introduce Semi-Matching with Demands (SMD), which models a certain problem in sensor networks of assigning individual sensors to sensing tasks. If there are multiple sensing tas...
INFOCOM
2006
IEEE
15 years 5 months ago
2006
IEEE
— High-order full-state Markov (FSM) chains have been employed to model errors and losses in many wireless studies. The complexity of this modeling paradigm is an exponential fun...