Sciweavers

2907 search results - page 158 / 582
» Presentations of Structures in Admissible Sets
Sort
View
INFOCOM
2010
IEEE
15 years 5 months ago
Building Scalable Virtual Routers with Trie Braiding
—Many popular algorithms for fast packet forwarding and filtering rely on the tree data structure. Examples are the trie-based IP lookup and packet classification algorithms. W...
Haoyu Song, Murali S. Kodialam, Fang Hao, T. V. La...
NAR
2011
274views Computer Vision» more  NAR 2011»
15 years 1 months ago
A series of PDB related databases for everyday needs
The Protein Data Bank (PDB) is the world-wide repository of macromolecular structure information. We present a series of databases that run parallel to the PDB. Each database hold...
Robbie P. Joosten, Tim A. H. te Beek, Elmar Kriege...
JMLR
2010
140views more  JMLR 2010»
15 years 1 months ago
Learning Non-Stationary Dynamic Bayesian Networks
Learning dynamic Bayesian network structures provides a principled mechanism for identifying conditional dependencies in time-series data. An important assumption of traditional D...
Joshua W. Robinson, Alexander J. Hartemink
ISAAC
2007
Springer
156views Algorithms» more  ISAAC 2007»
16 years 19 days ago
Approximate Range Searching in External Memory
In this paper, we present two linear-size external memory data structures for approximate range searching. Our first structure, the BAR-B-tree, stores a set of N points in Rd and ...
Micha Streppel, Ke Yi
INFFUS
2006
101views more  INFFUS 2006»
15 years 6 months ago
Fusion rules for merging uncertain information
In previous papers, we have presented a logic-based framework based on fusion rules for merging structured news reports [Hun00, Hun02b, Hun02a, HS03, HS04]. Structured news report...
Anthony Hunter, Weiru Liu