1236 search results - page 151 / 248 » Prefix-Like Complexities and Computability in the Limit |
WSC
2001
14 years 11 months ago
2001
Simulation beginners often spend a great amount of time to accumulate the knowledge as well as the experience to overcome the technical complexity of computer simulation. Limited ...
SODA
2000
ACM
14 years 11 months ago
2000
ACM
We present a model that enables us to analyze the running time of an algorithm on a computer with a memory hierarchy with limited associativity, in terms of various cache parameter...
STACS
2005
Springer
15 years 3 months ago
2005
Springer
An infinite binary sequence X is Kolmogorov-Loveland (or KL) random if there is no computable non-monotonic betting strategy that succeeds on X in the sense of having an unbounde...
ICPR
2010
IEEE
15 years 10 days ago
2010
IEEE
Training datasets for object detection problems are typically very large and Support Vector Machine (SVM) implementations are computationally complex. As opposed to these complex ...
ECCV
2008
Springer
15 years 11 months ago
2008
Springer
This paper addresses the segmentation from an image of entities that have the form of a `network', i.e. the region in the image corresponding to the entity is composed of bran...