Sciweavers

360 search results - page 25 / 72
» Distributed Network Querying with Bounded Approximate Cachin...
Sort
View
SIGOPS
2010
126views more  SIGOPS 2010»
14 years 10 months ago
Scaling a monitoring infrastructure for the Akamai network
We describe the design of, and experience with, Query, a monitoring system that supports the Akamai EdgePlatform. Query is a foundation of Akamai’s approach to administering its...
Thomas Repantis, Jeff Cohen, Scott Smith, Joel Wei...
SODA
2001
ACM
79views Algorithms» more  SODA 2001»
15 years 1 months ago
Learning Markov networks: maximum bounded tree-width graphs
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
David R. Karger, Nathan Srebro
SIGMOD
2005
ACM
133views Database» more  SIGMOD 2005»
15 years 12 months ago
Constrained Optimalities in Query Personalization
Personalization is a powerful mechanism that helps users to cope with the abundance of information on the Web. Database query personalization achieves this by dynamically construc...
Georgia Koutrika, Yannis E. Ioannidis
MOBIHOC
2007
ACM
15 years 11 months ago
Bounds for the capacity of wireless multihop networks imposed by topology and demand
Existing work on the capacity of wireless networks predominantly considers homogeneous random networks with random work load. The most relevant bounds on the network capacity, e.g...
Alireza Keshavarz-Haddad, Rudolf H. Riedi
ICDE
2009
IEEE
139views Database» more  ICDE 2009»
16 years 1 months ago
Minimizing Communication Cost in Distributed Multi-query Processing
Increasing prevalence of large-scale distributed monitoring and computing environments such as sensor networks, scientific federations, Grids etc., has led to a renewed interest in...
Jian Li, Amol Deshpande, Samir Khuller