Sciweavers

529 search results - page 89 / 106
» Online Network Design with Outliers
Sort
View
WWW
2004
ACM
14 years 10 months ago
Towards context-aware adaptable web services
In this paper, we present a context framework that facilitates the development and deployment of context-aware adaptable Web services. Web services are provided with context infor...
Markus Keidl, Alfons Kemper
KDD
2008
ACM
186views Data Mining» more  KDD 2008»
14 years 10 months ago
Scalable and near real-time burst detection from eCommerce queries
In large scale online systems like Search, eCommerce, or social network applications, user queries represent an important dimension of activities that can be used to study the imp...
Nish Parikh, Neel Sundaresan
KDD
2007
ACM
184views Data Mining» more  KDD 2007»
14 years 10 months ago
GraphScope: parameter-free mining of large time-evolving graphs
How can we find communities in dynamic networks of social interactions, such as who calls whom, who emails whom, or who sells to whom? How can we spot discontinuity timepoints in ...
Jimeng Sun, Christos Faloutsos, Spiros Papadimitri...
CHI
2005
ACM
14 years 10 months ago
eyeView: focus+context views for large group video conferences
In this paper, we describe the design of eyeView, a video conferencing system that uses participant looking behavior to determine the size of online video conferencing windows. Th...
Tracy Jenkin, Jesse McGeachie, David Fono, Roel Ve...
STOC
2003
ACM
130views Algorithms» more  STOC 2003»
14 years 10 months ago
A tight bound on approximating arbitrary metrics by tree metrics
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...
Jittat Fakcharoenphol, Satish Rao, Kunal Talwar