1679 search results - page 46 / 336 » Pointcuts as Functional Queries |
APPROX
2005
Springer
15 years 6 months ago
2005
Springer
We consider the quantum database search problem, where we are given a function f : [N] → {0, 1}, and are required to return an x ∈ [N] (a
101
Voted
VLDB
2001
ACM
15 years 5 months ago
2001
ACM
Similarity retrieval mechanisms should utilize generalized quadratic form distance functions as well as the Euclidean distance function since ellipsoid queries parameters may vary...
105
Voted
ICML
2007
IEEE
16 years 1 months ago
2007
IEEE
Increasingly large collections of structured data necessitate the development of efficient, noise-tolerant retrieval tools. In this work, we consider this issue and describe an ap...
130
Voted
IEAAIE
2009
Springer
15 years 7 months ago
2009
Springer
In this paper, we propose to apply an NA-tree in the Chord system to encode spatial region data in the data key part used in the hash function to data search. That is, we combine t...
106
Voted
ML
1998
ACM
15 years 12 days ago
1998
ACM
It is well known that prior knowledge or bias can speed up learning, at least in theory. It has proved di cult to make constructive use of prior knowledge, so that approximately c...