Sciweavers

1941 search results - page 376 / 389
» On the Hardness of Approximate Reasoning
Sort
View
SIGMOD
2004
ACM
262views Database» more  SIGMOD 2004»
15 years 9 months ago
The Next Database Revolution
Database system architectures are undergoing revolutionary changes. Most importantly, algorithms and data are being unified by integrating programming languages with the database ...
Jim Gray
MOBIHOC
2008
ACM
15 years 9 months ago
Dynamic packet fragmentation for wireless channels with failures
It was shown recently [7?9], under quite general conditions, that retransmission-based protocols may result in power-law delays and possibly zero throughput even if the distributi...
Predrag R. Jelenkovic, Jian Tan
SDM
2009
SIAM
164views Data Mining» more  SDM 2009»
15 years 6 months ago
Exact Discovery of Time Series Motifs.
Time series motifs are pairs of individual time series, or subsequences of a longer time series, which are very similar to each other. As with their discrete analogues in computat...
Abdullah Mueen, Eamonn J. Keogh, M. Brandon Westov...
81
Voted
INFOCOM
2009
IEEE
15 years 4 months ago
A Queueing Model Framework of PCE-Based Inter-Area Path Computation
Abstract—Path computation elements (PCE’s) are used to compute end-to-end paths across multiple areas. Multiple PCE’s may be dedicated to each area to provide sufficient path...
Juanjuan Yu, Yue He, Kai Wu, Marco Tacca, Andrea F...
INFOCOM
2009
IEEE
15 years 4 months ago
Searching for Stability in Interdomain Routing
—The Border Gateway Protocol (BGP) handles the task of establishing routes between the Autonomous Systems (ASes) that make up the Internet. It is known that it is possible for a ...
Rahul Sami, Michael Schapira, Aviv Zohar