2485 search results - page 220 / 497 » Time Bounded Frequency Computations |
178
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
In the cyclic-to-random shuffle, we are given n cards arranged in a circle. At step k, we exchange the k'th card along the circle with a uniformly chosen random card. The pro...
178
click to vote
CINQ
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Solving inductive queries which have to return complete collections of patterns satisfying a given predicate has been studied extensively the last few years. The specific...
146
click to vote
RTSS
2005
IEEE
16 years 4 days ago
2005
IEEE
The design phase of any real-time system requires balancing the limited computational resources against the functional requirements and the performance of the application. The opt...
166
click to vote
ICML
1996
IEEE
16 years 7 months ago
1996
IEEE
Within Valiant'smodel of learning as formalized by Kearns, we show that computable total predicates for two formallyuncomputable problems the classical Halting Problem, and t...
197
click to vote
CLOUDCOM
2010
Springer
15 years 4 months ago
2010
Springer
Commercial cloud offerings, such as Amazon's EC2, let users allocate compute resources on demand, charging based on reserved time intervals. While this gives great flexibilit...