Sciweavers

1461 search results - page 192 / 293
» The Cost of Cache-Oblivious Searching
Sort
View
ECEASST
2006
305views more  ECEASST 2006»
15 years 6 months ago
The ParMol Package for Frequent Subgraph Mining
Mining for frequent subgraphs in a graph database has become a popular topic in the last years. Algorithms to solve this problem are used in chemoinformatics to find common molecul...
Thorsten Meinl, Marc Wörlein, Olga Urzova, In...
CN
2007
123views more  CN 2007»
15 years 6 months ago
Information retrieval in schema-based P2P systems using one-dimensional semantic space
The widespread use of RDF-based information necessitates efficient information retrieval techniques in wide-area networks. In this paper, we present Dynamic Semantic Space, a sche...
Tao Gu, Hung Keng Pung, Daqing Zhang
IGPL
2006
90views more  IGPL 2006»
15 years 6 months ago
Surviving Abduction
Abduction or retroduction, as introduced by C.S. Peirce in the double sense of searching for explanatory instances and providing an explanation (i.e., involving the procedure of s...
Walter Alexandre Carnielli
JEA
2008
112views more  JEA 2008»
15 years 6 months ago
Dynamic spatial approximation trees
The Spatial Approximation Tree (sa-tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alternative data...
Gonzalo Navarro, Nora Reyes
JMLR
2006
145views more  JMLR 2006»
15 years 6 months ago
Ensemble Pruning Via Semi-definite Programming
An ensemble is a group of learning models that jointly solve a problem. However, the ensembles generated by existing techniques are sometimes unnecessarily large, which can lead t...
Yi Zhang 0006, Samuel Burer, W. Nick Street