2645 search results - page 292 / 529 » time 2003 |
181
click to vote
KDD
2003
ACM
16 years 7 months ago
2003
ACM
Burst detection is the activity of finding abnormal aggregates in data streams. Such aggregates are based on sliding windows over data streams. In some applications, we want to mo...
172
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
197
click to vote
SIGMOD
2003
ACM
16 years 6 months ago
2003
ACM
In many applications involving continuous data streams, data arrival is bursty and data rate fluctuates over time. Systems that seek to give rapid or real-time query responses in ...
171
click to vote
SIGMOD
2003
ACM
16 years 6 months ago
2003
ACM
This paper presents a novel strategy for temporal coalescing. Temporal coalescing merges the temporal extents of value-equivalent tuples. A temporal extent is usually coalesced of...
177
click to vote
ICSE
2003
IEEE-ACM
16 years 6 months ago
2003
IEEE-ACM
Problems and Programmers is an educational card game that we have developed to help teach software engineering. It is based on the observation that students, in a typical software...