Sciweavers

449 search results - page 13 / 90
» Distributed Reasoning in a Peer-to-Peer Setting
Sort
View
ICDE
2006
IEEE
156views Database» more  ICDE 2006»
15 years 11 months ago
Reasoning About Approximate Match Query Results
Join techniques deploying approximate match predicates are fundamental data cleaning operations. A variety of predicates have been utilized to quantify approximate match in such o...
Sudipto Guha, Nick Koudas, Divesh Srivastava, Xiao...
VALUETOOLS
2006
ACM
167views Hardware» more  VALUETOOLS 2006»
15 years 3 months ago
Detailed cache simulation for detecting bottleneck, miss reason and optimization potentialities
Cache locality optimization is an efficient way for reducing the idle time of modern processors in waiting for needed data. This kind of optimization can be achieved either on the...
Jie Tao, Wolfgang Karl
JCST
2006
65views more  JCST 2006»
14 years 10 months ago
P-Tree Structures and Event Horizon: Efficient Event-Set Implementations
This paper describes efficient data structures, namely the Indexed P-tree, Block P-tree, and Indexed-Block P-tree (or IP-tree, BP-tree, and IBP-tree, respectively, for short), for...
Katerina Asdre, Stavros D. Nikolopoulos
ILP
2003
Springer
15 years 3 months ago
A Comparative Evaluation of Feature Set Evolution Strategies for Multirelational Boosting
Boosting has established itself as a successful technique for decreasing the generalization error of classification learners by basing predictions on ensembles of hypotheses. Whil...
Susanne Hoche, Stefan Wrobel
RR
2007
Springer
15 years 4 months ago
Evaluating Formalisms for Modular Ontologies in Distributed Information Systems
Modern semantic technology is one of the necessary supports for the infrastructure of next generation information systems. In particular, large international organizations, which u...
Yimin Wang, Jie Bao, Peter Haase, Guilin Qi