Sciweavers

14165 search results - page 625 / 2833
» The generalized two-server problem
Sort
View
STOC
2003
ACM
96views Algorithms» more  STOC 2003»
16 years 7 months ago
Optimal oblivious routing in polynomial time
A recent seminal result of R?acke is that for any network there is an oblivious routing algorithm with a polylog competitive ratio with respect to congestion. Unfortunately, R?ack...
Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, H...
ICSE
2005
IEEE-ACM
16 years 7 months ago
Beyond computer science
Computer science is necessary but not sufficient to understand and overcome the problems we face in software engineering. We need to understand not only the properties of the soft...
James D. Herbsleb
ICDM
2007
IEEE
124views Data Mining» more  ICDM 2007»
16 years 1 months ago
Community Learning by Graph Approximation
Learning communities from a graph is an important problem in many domains. Different types of communities can be generalized as link-pattern based communities. In this paper, we p...
Bo Long, Xiaoyun Xu, Zhongfei (Mark) Zhang, Philip...
HYBRID
2007
Springer
16 years 1 months ago
The Concept of Deadlock and Livelock in Hybrid Control Systems
This short paper qualitatively introduces the definition of the concepts of Deadlock and Livelock for a general class of Hybrid Control Systems (HCS). Such a characterization hing...
Alessandro Abate, Alessandro D'Innocenzo, Giordano...
ICDM
2006
IEEE
193views Data Mining» more  ICDM 2006»
16 years 1 months ago
Local Correlation Tracking in Time Series
We address the problem of capturing and tracking local correlations among time evolving time series. Our approach is based on comparing the local auto-covariance matrices (via the...
Spiros Papadimitriou, Jimeng Sun, Philip S. Yu