Sciweavers

1355 search results - page 73 / 271
» Alternating Timed Automata over Bounded Time
Sort
View
SIGMOD
2008
ACM
138views Database» more  SIGMOD 2008»
14 years 9 months ago
Sampling time-based sliding windows in bounded space
Random sampling is an appealing approach to build synopses of large data streams because random samples can be used for a broad spectrum of analytical tasks. Users are often inter...
Rainer Gemulla, Wolfgang Lehner
INFOCOM
2011
IEEE
13 years 20 days ago
Sharing multiple messages over mobile networks
—Information dissemination in a large network is typically achieved when each user shares its own information or resources with each other user. Consider n users randomly located...
Yuxin Chen, Sanjay Shakkottai, Jeffrey G. Andrews
CGO
2006
IEEE
14 years 3 months ago
Fast and Effective Orchestration of Compiler Optimizations for Automatic Performance Tuning
Although compile-time optimizations generally improve program performance, degradations caused by individual techniques are to be expected. One promising research direction to ove...
Zhelong Pan, Rudolf Eigenmann
MTA
2007
79views more  MTA 2007»
13 years 8 months ago
Periodic broadcast with dynamic server selection
Abstract—Service replication is an effective way to address resource requirements and resource availability problem. Dynamic service selection enables clients to choose a server ...
Ewa Kusmierek, Yingping Lu, David Hung-Chang Du
DMKD
2003
ACM
148views Data Mining» more  DMKD 2003»
14 years 2 months ago
A symbolic representation of time series, with implications for streaming algorithms
The parallel explosions of interest in streaming data, and data mining of time series have had surprisingly little intersection. This is in spite of the fact that time series data...
Jessica Lin, Eamonn J. Keogh, Stefano Lonardi, Bil...