569 search results - page 33 / 114 » High Performance Reasoning with Very Large Knowledge Bases |
IMC
2003
ACM
15 years 2 months ago
2003
ACM
—This paper presents a family of bitmap algorithms that address the problem of counting the number of distinct header patterns (flows) seen on a high-speed link. Such counting c...
ASSETS
2005
ACM
14 years 11 months ago
2005
ACM
We propose an integrated approach to interactive word-completion for users with linguistic disabilities in which semantic knowledge combines with n-gram probabilities to predict s...
INFOCOM
2012
IEEE
13 years 3 days ago
2012
IEEE
Abstract—In this paper, we implement and evaluate three different Byzantine Fault-Tolerant (BFT) state machine replication protocols for data centers: (1) BASIC: The classic solu...
115
click to vote
KR
2004
Springer
15 years 3 months ago
2004
Springer
The demand for ontologies is rapidly growing especially due to developments in knowledge management, E-commerce and the Semantic Web. Building an ontology and a background knowled...
SIGMOD
2001
ACM
15 years 9 months ago
2001
ACM
In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or ra...