325 search results - page 38 / 65 » Alternatives to two classic data structures |
PADL
1999
Springer
15 years 1 months ago
1999
Springer
Abstract. One important advantage of logic programming is that it allows the implicit exploitation of parallelism. Towards this goal, we suggest that or-parallelism can be efficien...
80
Voted
ESA
2006
Springer
15 years 1 months ago
2006
Springer
A counting Bloom filter (CBF) generalizes a Bloom filter data structure so as to allow membership queries on a set that can be changing dynamically via insertions and deletions. As...
ACL
2001
14 years 11 months ago
2001
Current alternatives for language modeling are statistical techniques based on large amounts of training data, and hand-crafted context-free or finite-state grammars that are diff...
UIST
2006
ACM
15 years 3 months ago
2006
ACM
To disentangle and analyze neural pathways estimated from magnetic resonance imaging data, scientists need an interface to select 3D pathways. Broad adoption of such an interface ...
INFOCOM
2005
IEEE
15 years 3 months ago
2005
IEEE
This paper analyzes a single server queueing system in which service is alternated between two queues and the server requires a (finite) switchover time to switch from one queue ...