Sciweavers

5356 search results - page 205 / 1072
» Adventures in time and space
Sort
View
CTCS
1989
Springer
15 years 10 months ago
Temporal Structures
We combine the principles of the Floyd-Warshall-Kleene algorithm, enriched categories, and Birkhoff arithmetic, to yield a useful class of algebras of transitive vertex-labeled s...
Ross Casley, Roger F. Crew, José Meseguer, ...
ICASSP
2009
IEEE
16 years 1 months ago
A frequency hopping spread spectrum transmission scheme for uncoordinated cognitive radios
One of the major challenges to cognitive radios is the synchronization of distributed radios onto the same spectrum white spaces which vary in time and space. In this paper, we pr...
Xiaohua Li, Juite Hwu
FOCS
2006
IEEE
16 years 19 days ago
Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions
We present an algorithm for the c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time of O(dn1/c2 +o(1) ) and space O(dn + n1+1/c2 +o(1) ...
Alexandr Andoni, Piotr Indyk
IPL
2010
94views more  IPL 2010»
15 years 5 months ago
A compact data structure for representing a dynamic multiset
We develop a data structure for maintaining a dynamic multiset that uses O(n lg lg n/ lg n) bits and O(1) words, in addition to the space required by the n elements stored, suppor...
Jyrki Katajainen, S. Srinivasa Rao
FOCS
2007
IEEE
16 years 28 days ago
Strongly History-Independent Hashing with Applications
We present a strongly history independent (SHI) hash table that supports search in O(1) worst-case time, and insert and delete in O(1) expected time using O(n) data space. This ma...
Guy E. Blelloch, Daniel Golovin