2631 search results - page 406 / 527 » A Practical Method for the Sparse Resultant |
KDD
1998
ACM
14 years 1 months ago
1998
ACM
Practical clustering algorithms require multiple data scans to achieve convergence. For large databases, these scans become prohibitively expensive. We present a scalable clusteri...
FOCS
1989
IEEE
14 years 1 months ago
1989
IEEE
We present a randomized strategy for maintaining balance in dynamically changing search trees that has optimal expected behavior. In particular, in the expected case a search or a...
ASWC
2006
Springer
14 years 1 months ago
2006
Springer
With the increasing use of ontologies in Semantic Web and enterprise knowledge management, it is critical to develop scalable and efficient ontology management systems. In this pap...
KR
1991
Springer
14 years 23 days ago
1991
Springer
Theories of rational belief revision recently proposed by Alchourron, Gardenfors, Makinson, and Nebel illuminate many important issues but impose unnecessarily strong standards fo...
DBSEC
2007
13 years 10 months ago
2007
Abstract. The database server is a crucial bottleneck in traditional inference control architecture, as it enforces highly computation-intensive auditing for all users who query th...