Sciweavers

1615 search results - page 67 / 323
» Computer science and decision theory
Sort
View
COCO
2006
Springer
118views Algorithms» more  COCO 2006»
14 years 20 days ago
Learning Monotone Decision Trees in Polynomial Time
We give an algorithm that learns any monotone Boolean function f : {-1, 1}n {-1, 1} to any constant accuracy, under the uniform distribution, in time polynomial in n and in the de...
Ryan O'Donnell, Rocco A. Servedio
ACMSE
2006
ACM
14 years 21 days ago
Revisiting a limit on efficient quantum computation
In this paper, we offer an exposition of a theorem originally due to Adleman, Demarrais and Huang that shows that the quantum complexity class BQP (Bounded-error Quantum Polynomia...
Tarsem S. Purewal Jr.

Presentation
2959views
14 years 4 months ago
How to Come Up with New Research Ideas in Computer Vision
Computer vision has been studied for more than 40 years. Due to the increasingly diverse and rapidly developed topics in vision and the related fields (e.g., machine learning, sign...
Jia-Bin Huang
ESCIENCE
2006
IEEE
14 years 18 days ago
Toward Standards for Integration of Instruments into Grid Computing Environments
Instruments and sensors are the primary sources of data driving science and the development and refinement of theory. A critical component of eresearch yet to be clarified is the ...
Donald F. McMullen, Ian M. Atkinson, Kenneth Chiu,...
ACSC
2006
IEEE
14 years 3 months ago
Modelling layer 2 and layer 3 device bandwidths using B-node theory
Modern computer networks contain an amalgamation of devices and technologies, with the performance exhibited by each central to digital communications. Varieties of methods exist ...
S. Cikara, Stanislaw P. Maj, David T. Shaw