4112 search results - page 141 / 823 » Efficient Algorithms for the Spoonerism Problem |
169
click to vote
PODS
2006
ACM
16 years 4 months ago
2006
ACM
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
118
click to vote
AUTOMATICA
2005
15 years 4 months ago
2005
State estimation problems for linear time-invariant systems with noisy inputs and outputs are considered. An efficient recursive algorithm for the smoothing problem is presented. ...
122
click to vote
COR
2008
15 years 4 months ago
2008
Introducing a new concept of (, )-fairness, which allows for a bounded fairness compromise, so that a source is allocated a rate neither less than 0 1, nor more than 1, times...
159
Voted
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
173
click to vote
HIPC
2009
Springer
15 years 2 months ago
2009
Springer
Stream computing research is moving from terascale to petascale levels. It aims to rapidly analyze data as it streams in from many sources and make decisions with high speed and a...