Sciweavers

5144 search results - page 649 / 1029
» Enhancing Search with Structure
Sort
View
AINA
2009
IEEE
16 years 1 months ago
A Fast and Memory Efficient Dynamic IP Lookup Algorithm Based on B-Tree
—This paper deals with the traditional IP address lookup problem with fast updates. We propose a B-tree data structure, called MMSPT (Multiway Most Specific Prefix Tree), which i...
Yeim-Kuan Chang, Yung-Chieh Lin
WCRE
2009
IEEE
16 years 1 months ago
Automatic Package Coupling and Cycle Minimization
Abstract—Object-oriented (OO) software is usually organized into subsystems using the concepts of package or module. Such modular structure helps applications to evolve when faci...
Hani Abdeen, Stéphane Ducasse, Houari A. Sa...
ISDA
2009
IEEE
16 years 1 months ago
Similarity Analysis of Protein Binding Sites: A Generalization of the Maximum Common Subgraph Measure Based on Quasi-Clique Dete
—Protein binding sites are often represented by means of graphs capturing their most important geometrical and physicochemical properties. Searching for structural similarities a...
Imen Boukhris, Zied Elouedi, Thomas Fober, Marco M...
LICS
2009
IEEE
16 years 1 months ago
Indexed Containers
The search for an expressive calculus of datatypes in which canonical algorithms can be easily written and proven correct has proved to be an enduring challenge to the theoretical ...
Thorsten Altenkirch, Peter Morris
258
Voted
GLOBECOM
2008
IEEE
16 years 1 months ago
A Memory-Optimized Bloom Filter Using an Additional Hashing Function
— A Bloom filter is a simple space-efficient randomized data structure for the representation set of items in order to support membership queries. In recent years, Bloom filte...
Mahmood Ahmadi, Stephan Wong