2080 search results - page 58 / 416 » Measuring empirical computational complexity |
ALT
2000
Springer
14 years 1 months ago
2000
Springer
In this paper1 we propose a new algorithm for providing confidence and credibility values for predictions on a multi-class pattern recognition problem which uses Support Vector mac...
COCO
2004
Springer
14 years 3 months ago
2004
Springer
Entanglement is an essential resource for quantum communication and quantum computation, similar to shared random bits in the classical world. Entanglement distillation extracts n...
SIGMETRICS
2003
ACM
14 years 3 months ago
2003
ACM
Empirical evidence suggests that reactive routing systems improve resilience to Internet path failures. They detect and route around faulty paths based on measurements of path per...
COMSIS
2010
13 years 6 months ago
2010
We present a novel method to robustly and efficiently detect moving object, even under the complexity background, such as illumination changes, long shadows etc. This work is disti...
ICALP
2011
Springer
13 years 1 months ago
2011
Springer
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...