Sciweavers

1510 search results - page 259 / 302
» Upper Probabilities and Additivity
Sort
View
IANDC
2008
141views more  IANDC 2008»
14 years 9 months ago
Graph connectivity, partial words, and a theorem of Fine and Wilf
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
Francine Blanchet-Sadri, Deepak Bal, Gautam Sisodi...
KDD
2009
ACM
364views Data Mining» more  KDD 2009»
15 years 10 months ago
Causality quantification and its applications: structuring and modeling of multivariate time series
Time series prediction is an important issue in a wide range of areas. There are various real world processes whose states vary continuously, and those processes may have influenc...
Takashi Shibuya, Tatsuya Harada, Yasuo Kuniyoshi
KDD
2002
ACM
166views Data Mining» more  KDD 2002»
15 years 10 months ago
Exploiting response models: optimizing cross-sell and up-sell opportunities in banking
The banking industry regularly mounts campaigns to improve customer value by offering new products to existing customers. In recent years this approach has gained significant mome...
Andrew Storey, Marc-David Cohen
SIGMETRICS
2005
ACM
117views Hardware» more  SIGMETRICS 2005»
15 years 3 months ago
Classifying scheduling policies with respect to higher moments of conditional response time
In addition to providing small mean response times, modern applications seek to provide users predictable service and, in some cases, Quality of Service (QoS) guarantees. In order...
Adam Wierman, Mor Harchol-Balter
SPAA
1997
ACM
15 years 1 months ago
Accessing Nearby Copies of Replicated Objects in a Distributed Environment
Consider a set of shared objects in a distributed network, where several copies of each object may exist at any given time. To ensure both fast access to the objects as well as e ...
C. Greg Plaxton, Rajmohan Rajaraman, Andréa...