Sciweavers

4797 search results - page 348 / 960
» The complexity of partition tasks
Sort
View
WWW
2008
ACM
16 years 7 months ago
Offline matching approximation algorithms in exchange markets
Motivated by several marketplace applications on rapidly growing online social networks, we study the problem of efficient offline matching algorithms for online exchange markets....
Zeinab Abbassi, Laks V. S. Lakshmanan
PODS
2009
ACM
229views Database» more  PODS 2009»
16 years 7 months ago
Computing all skyline probabilities for uncertain data
Skyline computation is widely used in multi-criteria decision making. As research in uncertain databases draws increasing attention, skyline queries with uncertain data have also ...
Mikhail J. Atallah, Yinian Qi
SIGMOD
2005
ACM
107views Database» more  SIGMOD 2005»
16 years 6 months ago
Goals and Benchmarks for Autonomic Configuration Recommenders
We are witnessing an explosive increase in the complexity of the information systems we rely upon. Autonomic systems address this challenge by continuously configuring and tuning ...
Mariano P. Consens, Denilson Barbosa, Adrian M. Te...
ISPD
2010
ACM
207views Hardware» more  ISPD 2010»
16 years 1 months ago
FOARS: FLUTE based obstacle-avoiding rectilinear steiner tree construction
Obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) construction is becoming one of the most sought after problems in modern design flow. In this paper we present FOARS, ...
Gaurav Ajwani, Chris Chu, Wai-Kei Mak
IPPS
2009
IEEE
16 years 1 months ago
Compact graph representations and parallel connectivity algorithms for massive dynamic network analysis
Graph-theoretic abstractions are extensively used to analyze massive data sets. Temporal data streams from socioeconomic interactions, social networking web sites, communication t...
Kamesh Madduri, David A. Bader