Sciweavers

4850 search results - page 111 / 970
» Approximate Data Structures with Applications
Sort
View
AAAI
2007
15 years 9 days ago
Partial Matchmaking using Approximate Subsumption
Description Logics, and in particular the web ontology language OWL has been proposed as an appropriate basis for computing matches between structured objects for the sake of info...
Heiner Stuckenschmidt
ICNP
2007
IEEE
15 years 4 months ago
HEXA: Compact Data Structures for Faster Packet Processing
—Data structures representing directed graphs with edges labeled by symbols from a finite alphabet are used to implement packet processing algorithms used in a variety of network...
Sailesh Kumar, Jonathan S. Turner, Patrick Crowley...
ACMMSP
2005
ACM
101views Hardware» more  ACMMSP 2005»
15 years 3 months ago
Transparent pointer compression for linked data structures
64-bit address spaces are increasingly important for modern applications, but they come at a price: pointers use twice as much memory, reducing the effective cache capacity and m...
Chris Lattner, Vikram S. Adve
NAR
2011
214views Computer Vision» more  NAR 2011»
14 years 24 days ago
IEDB-3D: structural data within the immune epitope database
IEDB-3D is the 3D structural component of the Immune Epitope Database (IEDB) available via the ‘Browse by 3D Structure’ page at http://www.iedb .org. IEDB-3D catalogs B- and T...
Julia V. Ponomarenko, Nikitas Papangelopoulos, Dir...
BMCBI
2008
103views more  BMCBI 2008»
14 years 10 months ago
Discovering multi-level structures in bio-molecular data through the Bernstein inequality
Background: The unsupervised discovery of structures (i.e. clusterings) underlying data is a central issue in several branches of bioinformatics. Methods based on the concept of s...
Alberto Bertoni, Giorgio Valentini