2698 search results - page 285 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
179
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
In this paper, we propose GAD (General Activity Detection) for fast clustering on large scale data. Within this framework we design a set of algorithms for different scenarios: (...
210
click to vote
TMC
2010
15 years 5 months ago
2010
—Throughput optimization in wireless networks with multiple channels and multiple radio interfaces per node is a challenging problem. For general traffic models (given a set of ...
179
click to vote
SIGMOD
2004
ACM
16 years 1 days ago
2004
ACM
Clustering is one of the most important analysis tasks in spatial databases. We study the problem of clustering objects, which lie on edges of a large weighted spatial network. Th...
199
click to vote
PDPTA
2000
15 years 8 months ago
2000
Exploiting compile time knowledge to improve memory bandwidth can produce noticeable improvements at run-time [13, 1]. Allocating the data structure [13] to separate memories when...
175
click to vote
TIP
2008
15 years 6 months ago
2008
This paper presents recursive cavity modeling--a principled, tractable approach to approximate, near-optimal inference for large Gauss-Markov random fields. The main idea is to su...