3368 search results - page 600 / 674 » The Complexity of Query Reliability |
ECCV
2006
Springer
14 years 12 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 ...
ICDE
2002
IEEE
14 years 11 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...
WWW
2006
ACM
14 years 10 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...
STOC
2003
ACM
14 years 10 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...
STACS
2010
Springer
14 years 5 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...