1093 search results - page 209 / 219 » Clustering from Constraint Graphs |
141
Voted
SODA
2012
ACM
13 years 6 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
169
Voted
MOBIHOC
2007
ACM
16 years 3 months ago
2007
ACM
We provide a general framework for the analysis of the capacity scaling properties in mobile ad-hoc networks with heterogeneous nodes and spatial inhomogeneities. Existing analyti...
120
click to vote
CCGRID
2008
IEEE
15 years 10 months ago
2008
IEEE
—Distributing large data to many nodes, known as a broadcast or a multicast, is an important operation in parallel and distributed computing. Most previous broadcast algorithms e...
92
Voted
CGO
2008
IEEE
15 years 10 months ago
2008
IEEE
In this paper we investigate the benefit of scheduling non-critical loads for a higher latency during software pipelining. "Noncritical" denotes those loads that have s...
174
Voted
IV
2008
IEEE
15 years 10 months ago
2008
IEEE
This article is addressing a recurrent problem in biology: mining newly built large scale networks. Our approach consists in comparing these new networks to well known ones. The v...