148 search results - page 1 / 30 » On data structures and asymmetric communication complexity |
STOC
1995
ACM
13 years 8 months ago
1995
ACM
c communication case. This lemma generalizes and abstracts in a very clean form the ``round reduction'' techniques used in many previous lower bound proofs. ] 1998 Academ...
FOCS
2008
IEEE
13 years 5 months ago
2008
IEEE
Recent years have seen a significant increase in our understanding of high-dimensional nearest neighbor search (NNS) for distances like the 1 and 2 norms. By contrast, our underst...
LREC
2008
13 years 6 months ago
2008
We describe a new multimodal corpus currently under development. The corpus consists of videos of task-oriented dialogues that are annotated for speaker's verbal requests and...
ICCNMC
2005
Springer
13 years 10 months ago
2005
Springer
With the fast growing size and complexity of core network, the hash based data structure of current AS_PATH implementation in BGP is facing challenges in performance, mainly caused...
COCO
2003
Springer
13 years 10 months ago
2003
Springer
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...