2485 search results - page 177 / 497 » Time Bounded Frequency Computations |
159
click to vote
RTSS
2008
IEEE
16 years 26 days ago
2008
IEEE
Abstract—We apply automata theory to specifying behavioral interfaces of objects and show how to check schedulability and compatibility of real time asynchronous objects. The beh...
276
click to vote
POPL
2008
ACM
16 years 6 months ago
2008
ACM
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
168
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
We consider the problem of representing, in a space-efficient way, a function f : S → Σ such that any function value can be computed in constant time on a RAM. Specifically, ou...
165
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
— In this paper, we study the problem of multi-path routing with bandwidth and delay constraints, which arises in applications for video delivery over bandwidth-limited networks....
212
click to vote
ADC
2008
Springer
16 years 26 days ago
2008
Springer
Mining frequent patterns in a data stream is very challenging for the high complexity of managing patterns with bounded memory against the unbounded data. While many approaches as...