Sciweavers

11151 search results - page 281 / 2231
» On the Complexity of Model Expansion
Sort
View
ALGORITHMICA
2002
94views more  ALGORITHMICA 2002»
15 years 7 months ago
The Quantum Black-Box Complexity of Majority
We describe a quantum black-box network computing the majority of N bits with zerosided error using only 2 3 N + O( N log( -1 log N)) queries: the algorithm returns the correct an...
Thomas P. Hayes, Samuel Kutin, Dieter van Melkebee...
TSMC
2002
110views more  TSMC 2002»
15 years 7 months ago
Complexity reduction for "large image" processing
We present a method for sampling feature vectors in large (e.g., 2000 5000 16 bit) images that finds subsets of pixel locations which represent "regions" in the image. Sa...
Nikhil R. Pal, James C. Bezdek
NCA
2007
IEEE
15 years 6 months ago
Safety management of complex technology
One of the key success factors behind the human species is the ability to think, plan and pursue goals. Apart from wisdom and tacit knowledge, experience and awareness of the phys...
Ali G. Hessami
CVPR
2012
IEEE
13 years 9 months ago
Complex loss optimization via dual decomposition
We describe a novel max-margin parameter learning approach for structured prediction problems under certain non-decomposable performance measures. Structured prediction is a commo...
Mani Ranjbar, Arash Vahdat, Greg Mori
CORR
2006
Springer
138views Education» more  CORR 2006»
15 years 7 months ago
Tight Bounds on the Complexity of Recognizing Odd-Ranked Elements
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
Shripad Thite