Sciweavers

549 search results - page 57 / 110
» Computing All the Best Swap Edges Distributively
Sort
View
SIGMOD
2008
ACM
214views Database» more  SIGMOD 2008»
15 years 10 months ago
A graph method for keyword-based selection of the top-K databases
While database management systems offer a comprehensive solution to data storage, they require deep knowledge of the schema, as well as the data manipulation language, in order to...
Quang Hieu Vu, Beng Chin Ooi, Dimitris Papadias, A...
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
15 years 10 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi
DCOSS
2006
Springer
15 years 1 months ago
GIST: Group-Independent Spanning Tree for Data Aggregation in Dense Sensor Networks
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
Lujun Jia, Guevara Noubir, Rajmohan Rajaraman, Rav...
SAC
2004
ACM
15 years 3 months ago
GD-GhOST: a goal-oriented self-tuning caching algorithm
A popular solution to internet performance problems is the widespread caching of data. Many caching algorithms have been proposed in the literature, most attempting to optimize fo...
Ganesh Santhanakrishnan, Ahmed Amer, Panos K. Chry...
ICPADS
2007
IEEE
15 years 4 months ago
Finding candidate spots for replica servers based on demand fluctuation
Many service providers distribute various kinds of content over the Internet. They often use replica servers to provide stable service. To position them appropriately, service pro...
Masato Asahara, Akio Shimada, Hiroshi Yamada, Kenj...