Sciweavers

1679 search results - page 91 / 336
» Pointcuts as Functional Queries
Sort
View
BDA
2007
15 years 5 months ago
Hyperplane Queries in a Feature-Space M-tree for Speeding up Active Learning
In content-based retrieval, relevance feedback (RF) is a noticeable method for reducing the “semantic gap” between the low-level features describing the content and the usually...
Michel Crucianu, Daniel Estevez, Vincent Oria, Jea...
IS
2007
15 years 4 months ago
Branch-and-bound processing of ranked queries
Despite the importance of ranked queries in numerous applications involving multi-criteria decision making, they are not efficiently supported by traditional database systems. In ...
Yufei Tao, Vagelis Hristidis, Dimitris Papadias, Y...
STACS
2009
Springer
15 years 11 months ago
Quantum Query Complexity of Multilinear Identity Testing
Motivated by the quantum algorithm for testing commutativity of black-box groups (Magniez and Nayak, 2007), we study the following problem: Given a black-box finite ring by an add...
Vikraman Arvind, Partha Mukhopadhyay
STACS
2000
Springer
15 years 8 months ago
Average-Case Quantum Query Complexity
Abstract. We compare classical and quantum query complexities of total Boolean functions. It is known that for worst-case complexity, the gap between quantum and classical can be a...
Andris Ambainis, Ronald de Wolf
IJIS
2007
93views more  IJIS 2007»
15 years 4 months ago
Perspectives on ontology-based querying
In this paper, we introduce principles for ontology-based querying of information bases. We consider a framework in which a basis ontology over atomic concepts in combination with ...
Rasmus Knappe, Henrik Bulskov, Troels Andreasen