Sciweavers

1091 search results - page 5 / 219
» Approximation Algorithms for Data Placement Problems
Sort
View
PODC
2005
ACM
15 years 5 months ago
Quorum placement in networks to minimize access delays
A quorum system is a family of sets (themselves called quorums), each pair of which intersect. In many distributed algorithms, the basic unit accessed by a client is a quorum of n...
Anupam Gupta, Bruce M. Maggs, Florian Oprea, Micha...
89
Voted
JMLR
2012
13 years 2 months ago
On Bisubmodular Maximization
Bisubmodularity extends the concept of submodularity to set functions with two arguments. We show how bisubmodular maximization leads to richer value-of-information problems, usin...
Ajit Singh, Andrew Guillory, Jeff Bilmes
STOC
1995
ACM
145views Algorithms» more  STOC 1995»
15 years 3 months ago
Polynomial time approximation schemes for dense instances of NP-hard problems
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
Sanjeev Arora, David R. Karger, Marek Karpinski
NPIV
1998
ACM
117views Visualization» more  NPIV 1998»
15 years 3 months ago
Data Object and Label Placement For Information Abundant Visualizations
Placing numerous data objects and their corresponding labels in limited screen space is a challenging problem in information visualization systems. Extending map-oriented techniqu...
Jia Li, Catherine Plaisant, Ben Shneiderman
114
Voted
GLOBECOM
2010
IEEE
14 years 9 months ago
Relay Station Placement for Cooperative Communications in WiMAX Networks
The recently emerging WiMAX (IEEE 802.16) is a promising telecommunication technology to provide low-cost, high-speed and long-range wireless communications. To meet the growing de...
Dejun Yang, Xi Fang, Guoliang Xue, Jian Tang