Sciweavers

6274 search results - page 126 / 1255
» From query complexity to computational complexity
Sort
View
ICPR
2002
IEEE
15 years 9 months ago
Face Recognition Using Optimal Non-Orthogonal Wavelet Basis Evaluated by Information Complexity
Detecting and recognizing face images automatically is a difficult task due to the variability of illumination, presentation angle, face expression and other common problems of m...
Xiaoling Wang, Hairong Qi
JSAT
2006
126views more  JSAT 2006»
15 years 3 months ago
Complexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages
Several propositional fragments have been considered so far as target languages for knowledge compilation and used for improving computational tasks from major AI areas (like infe...
Sylvie Coste-Marquis, Daniel Le Berre, Florian Let...
STACS
2010
Springer
15 years 11 months ago
Quantum Algorithms for Testing Properties of Distributions
Abstract. Suppose one has access to oracles generating samples from two unknown probability distributions p and q on some N-element set. How many samples does one need to test whet...
Sergey Bravyi, Aram Wettroth Harrow, Avinatan Hass...
ICECCS
1995
IEEE
100views Hardware» more  ICECCS 1995»
15 years 7 months ago
POSD-a notation for presenting complex systems of processes
When trying to describe the behaviour of large systems, such as the business processes of large enterprises, we often adopt diagramming techniques based on derivatives of data flo...
Peter Henderson, Graham D. Pratten
ICRA
2006
IEEE
131views Robotics» more  ICRA 2006»
15 years 10 months ago
Proximity Queries between Convex Objects: an Interior Point Approach for Implicit Surfaces
— This paper presents an interior point approach to exact distance computation between convex objects represented as intersections of implicit surfaces. Exact distance computatio...
Nilanjan Chakraborty, Jufeng Peng, Srinivas Akella...