Sciweavers

274 search results - page 45 / 55
» Computational complexity of queries based on itemsets
Sort
View
123
Voted
PODS
2005
ACM
164views Database» more  PODS 2005»
16 years 16 days ago
Lower bounds for sorting with few random accesses to external memory
We consider a scenario where we want to query a large dataset that is stored in external memory and does not fit into main memory. The most constrained resources in such a situati...
Martin Grohe, Nicole Schweikardt
110
Voted
DEXA
2010
Springer
180views Database» more  DEXA 2010»
15 years 1 months ago
Approximate Instance Retrieval on Ontologies
With the development of more expressive description logics (DLs) for the Web Ontology Language OWL the question arises how we can properly deal with the high computational complexi...
Tuvshintur Tserendorj, Stephan Grimm, Pascal Hitzl...
111
Voted

Publication
309views
15 years 9 months ago
Improving Nearest Neighbor Classification with Cam Weighted Distance
Nearest neighbor (NN) classification assumes locally constant class conditional probabilities, and suffers from bias in high dimensions with a small sample set. In this paper, we p...
Changyin Zhou, Yanqiu Chen
85
Voted
POLICY
2004
Springer
15 years 5 months ago
Cassandra: Distributed Access Control Policies with Tunable Expressiveness
We study the specification of access control policy in large-scale distributed systems. Our work on real-world policies has shown that standard policy idioms such as role hierarc...
Moritz Y. Becker, Peter Sewell
DAC
2003
ACM
15 years 5 months ago
Advanced techniques for RTL debugging
Conventional register transfer level (RTL) debugging is based on overlaying simulation results on structural connectivity information of the Hardware Description Language (HDL) so...
Yu-Chin Hsu, Bassam Tabbara, Yirng-An Chen, Fur-Sh...