2485 search results - page 211 / 497 » Time Bounded Frequency Computations |
173
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
The past decade has witnessed many interesting algorithms for maintaining statistics over a data stream. This paper initiates a theoretical study of algorithms for monitoring distr...
168
click to vote
GD
1997
Springer
15 years 10 months ago
1997
Springer
This paper studies 3-D orthogonal grid drawings for graphs of arbitrary degree, in particular Kn, with vertices drawn as boxes. It establishes asymptotic lower bounds for the volu...
149
click to vote
CG
2006
Springer
15 years 6 months ago
2006
Springer
In this paper we consider the novel idea of closest feature maps (CFMs) applied to refinable collision response in order to address the potential issues and problems associated wi...
182
click to vote
JSAT
2006
15 years 6 months ago
2006
Cutting planes are a well-known, widely used, and very effective technique for Integer Linear Programming (ILP). However, cutting plane techniques are seldom used in PseudoBoolean...
263
click to vote
PODC
2011
ACM
14 years 9 months ago
2011
ACM
We study the time-complexity of robust atomic read/write storage from fault-prone storage components in asynchronous message-passing systems. Robustness here means wait-free tolera...