296 search results - page 51 / 60 » Approximation Algorithms for Requirement Cut on Graphs |
74
Voted
IPPS
2005
IEEE
15 years 3 months ago
2005
IEEE
This paper studies distributed scheduling of parallel I/O data transfers on systems that provide data replication. In our previous work, we proposed a centralized algorithm for so...
SODA
2012
ACM
13 years 22 hour 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...
101
click to vote
WADS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
EDBT
2009
ACM
15 years 4 months ago
2009
ACM
There has been an explosion of hyperlinked data in many domains, e.g., the biological Web. Expressive query languages and effective ranking techniques are required to convert this...
109
click to vote
INFOCOM
2006
IEEE
15 years 3 months ago
2006
IEEE
Abstract— Sensors typically use wireless transmitters to communicate with each other. However, sensors may be located in a way that they cannot even form a connected network (e.g...