Sciweavers

11212 search results - page 1994 / 2243
» Semi-persistent Data Structures
Sort
View
SIGCOMM
2005
ACM
15 years 9 months ago
Fast hash table lookup using extended bloom filter: an aid to network processing
Hash table is used as one of the fundamental modules in several network processing algorithms and applications such as route lookup, packet classification, per-flow state manage...
Haoyu Song, Sarang Dharmapurikar, Jonathan S. Turn...
VLDB
2005
ACM
93views Database» more  VLDB 2005»
15 years 9 months ago
Indexing Mixed Types for Approximate Retrieval
In various applications such as data cleansing, being able to retrieve categorical or numerical attributes based on notions of approximate match (e.g., edit distance, numerical di...
Liang Jin, Nick Koudas, Chen Li, Anthony K. H. Tun...
CF
2004
ACM
15 years 9 months ago
Improving the execution time of global communication operations
Many parallel applications from scientific computing use MPI global communication operations to collect or distribute data. Since the execution times of these communication opera...
Matthias Kühnemann, Thomas Rauber, Gudula R&u...
HT
2004
ACM
15 years 9 months ago
Hypertext versioning for embedded link models
In this paper, we describe Chrysant, a hypertext version control system for embedded link models. Chrysant provides generalpurpose versioning capability to hypertext systems with ...
Kai Pan, E. James Whitehead Jr., Guozheng Ge
MM
2004
ACM
167views Multimedia» more  MM 2004»
15 years 9 months ago
Learning an image manifold for retrieval
We consider the problem of learning a mapping function from low-level feature space to high-level semantic space. Under the assumption that the data lie on a submanifold embedded ...
Xiaofei He, Wei-Ying Ma, HongJiang Zhang
« Prev « First page 1994 / 2243 Last » Next »