2485 search results - page 64 / 497 » Time Bounded Frequency Computations |
138
click to vote
ATAL
2004
Springer
15 years 9 months ago
2004
Springer
We propose a context-logic style formalism, Timed Reasoning Logics (TRL), to describe resource-bounded reasoners who take time to derive consequences of their knowledge. The seman...
108
click to vote
ESA
2003
Springer
15 years 9 months ago
2003
Springer
We present a new finger search tree with O(1) worst-case update time and O(log log d) expected search time with high probability in the Random Access Machine (RAM) model of comput...
116
click to vote
CIE
2009
Springer
15 years 11 months ago
2009
Springer
computability uses ordinals instead of natural numbers in abstract machines like register or Turing machines. We give an overview of the computational strengths of α-β-machines,...
119
click to vote
TWC
2010
14 years 11 months ago
2010
Abstract--Frame detection and timing acquisition are challenging tasks in orthogonal frequency-division multiplexing systems plagued by narrowband interference (NBI). Most existing...
141
click to vote
CVPR
2008
IEEE
16 years 6 months ago
2008
IEEE
We introduce a new image representation that encompasses both the general layout of groups of quantized local invariant descriptors as well as their relative frequency. A graph of...