2485 search results - page 65 / 497 » Time Bounded Frequency Computations |
124
click to vote
DCC
2005
IEEE
16 years 4 months ago
2005
IEEE
We describe a domain-independent, unsupervised algorithm for refined segmentation of time series data into meaningful episodes, focusing on the problem of text segmentation. The V...
133
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We study ways to expedite Yates's algorithm for computing the zeta and Moebius transforms of a function defined on the subset lattice. We develop a trimmed variant of Moebius ...
168
click to vote
DDECS
2006
IEEE
15 years 8 months ago
2006
IEEE
Abstract-- Hard real-time systems need methods to determine upper bounds for their execution times, usually called worst-case execution times. Timing anomalies are counterintuitive...
146
click to vote
PODS
2005
ACM
15 years 10 months ago
2005
ACM
Heavy hitters, which are items occurring with frequency above a given threshold, are an important aggregation and summary tool when processing data streams or data warehouses. Hie...
138
click to vote
FOCS
1993
IEEE
15 years 8 months ago
1993
IEEE
: Weprove tight bounds on the time needed to solve k-set agreement, a natural generalization of consensus. We analyze this problem in a synchronous, message-passing model where pro...