520 search results - page 63 / 104 » Reductions Between Expansion Problems |
113
click to vote
IJCAI
2007
15 years 3 months ago
2007
This paper addresses the problem of concept sampling. In many real-world applications, a large collection of mixed concepts is available for decision making. However, the collecti...
105
click to vote
MST
2007
15 years 2 months ago
2007
Crown structures in a graph are defined and shown to be useful in kernelization algorithms for the classic vertex cover problem. Two vertex cover kernelization methods are discus...
141
click to vote
WCNC
2010
IEEE
15 years 25 days ago
2010
IEEE
—With the ever increasing interest in multiple-input multiple-output (MIMO) cognitive radio (CR) systems, reducing the costs associated with RF-chains at the radio front end beco...
144
click to vote
INFOCOM
2010
IEEE
15 years 12 days ago
2010
IEEE
We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and unders...
147
click to vote
INFOCOM
2010
IEEE
15 years 12 days ago
2010
IEEE
In recent years we have witnessed a great interest in large distributed computing platforms, also known as clouds. While these systems offer enormous computing power, they are howe...