Sciweavers

10633 search results - page 1806 / 2127
» Relating Distributed Objects
Sort
View
141
Voted
KDD
1997
ACM
213views Data Mining» more  KDD 1997»
15 years 7 months ago
A Probabilistic Approach to Fast Pattern Matching in Time Series Databases
Theproblemof efficiently and accurately locating patterns of interest in massivetimeseries data sets is an important and non-trivial problemin a wide variety of applications, incl...
Eamonn J. Keogh, Padhraic Smyth
SIGCOMM
1996
ACM
15 years 7 months ago
Hierarchical Packet Fair Queueing Algorithms
Hierarchical Packet Fair Queueing (H-PFQ)algorithms have the potential to simultaneously support guaranteed realtime service, rate-adaptive best-eort, and controlled linksharing s...
Jon C. R. Bennett, Hui Zhang
154
Voted
ICDE
1993
IEEE
158views Database» more  ICDE 1993»
15 years 7 months ago
Data fragmentation for parallel transitive closure strategies
A topic that is currently inspiring a lot of research is parallel (distributed) computation of transitive closure queries. In [lo] the disconnection set approach has been introduc...
Maurice A. W. Houtsma, Peter M. G. Apers, Gideon L...
ECAIW
1994
Springer
15 years 6 months ago
Agent Theories, Architectures, and Languages: A Survey
The concept of an agent has recently become important in Artificial Intelligence (AI), and its relatively youthful subfield, Distributed AI (DAI). Our aim in this paper is to poin...
Michael Wooldridge, Nicholas R. Jennings
116
Voted
SIGCOMM
1994
ACM
15 years 6 months ago
Wide-Area Traffic: The Failure of Poisson Modeling
Network arrivals are often modeled as Poisson processes for analytic simplicity, even though a number of traffic studies have shown that packet interarrivals are not exponentially...
Vern Paxson, Sally Floyd
« Prev « First page 1806 / 2127 Last » Next »