1485 search results - page 266 / 297 » connection 2010 |
STOC
2010
ACM
14 years 15 days ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
CHI
2010
ACM
14 years 14 days ago
2010
ACM
While the history of traditional media in post-conflict peace building efforts is rich and well studied, the potential for interactive new media technologies in this area has gone...
SIGECOM
2010
ACM
14 years 14 days ago
2010
ACM
One of the fundamental problems in the theory of social choice is aggregating the rankings of a set of agents (or voters) into a consensus ranking. Rank aggregation has found appl...
SIGMOD
2010
ACM
14 years 14 days ago
2010
ACM
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
SIGMOD
2010
ACM
14 years 14 days ago
2010
ACM
Providing scalable database services is an essential requirement for extending many existing applications of the Cloud platform. Due to the diversity of applications, database ser...