3368 search results - page 600 / 674 » The Complexity of Query Reliability |
147
Voted
ECCV
2006
Springer
16 years 4 months ago
2006
Springer
Recently, the wide deployment of practical face recognition systems gives rise to the emergence of the inter-modality face recognition problem. In this problem, the face images in ...
224
click to vote
ICDE
2002
IEEE
16 years 3 months ago
2002
IEEE
Nearest Neighbor search is an important and widely used problem in a number of important application domains. In many of these domains, the dimensionality of the data representati...
131
click to vote
WWW
2006
ACM
16 years 3 months ago
2006
ACM
High throughput glycoproteomics, similar to genomics and proteomics, involves extremely large volumes of distributed, heterogeneous data as a basis for identification and quantifi...
108
Voted
STOC
2003
ACM
16 years 2 months ago
2003
ACM
Given a database of n points in {0, 1}d, the partial match problem is: In response to a query x in {0, 1, }d, find a database point y such that for every i whenever xi = , we have...
105
click to vote
STACS
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. A Boolean function on N variables is called evasive if its decision-tree complexity is N. A sequence Bn of Boolean functions is eventually evasive if Bn is evasive for al...