872 search results - page 40 / 175 » Extreme lower probabilities |
COCO
2009
Springer
15 years 7 months ago
2009
Springer
One of the strongest techniques available for showing lower bounds on quantum communication complexity is the logarithm of the approximation rank of the communication matrix— th...
108
click to vote
FOCS
2006
IEEE
15 years 6 months ago
2006
IEEE
The quantum query complexity of searching for local optima has been a subject of much interest in the recent literature. For the d-dimensional grid graphs, the complexity has been...
88
Voted
ICCV
2005
IEEE
16 years 2 months ago
2005
IEEE
We propose an algorithm to recognize faces illuminated by arbitrarily placed, multiple light sources. The algorithm does not need to know the number of light sources and works extr...
61
Voted
ICPR
2000
IEEE
15 years 4 months ago
2000
IEEE
Vectorization, i.e. raster–to–vector conversion, is a central part of graphics recognition problems. In this paper, we discuss the pros and the cons of basing one’s vectoriz...
AAAI
1992
15 years 1 months ago
1992
We describe an approach to training a statistical parser from a bracketed corpus, and demonstrate its use in a software testing application that translates English speci cations i...