Sciweavers

43264 search results - page 199 / 8653
» Comparing models of computation
Sort
View
136
Voted
JCST
2010
139views more  JCST 2010»
15 years 1 months ago
Dirichlet Process Gaussian Mixture Models: Choice of the Base Distribution
In the Bayesian mixture modeling framework it is possible to infer the necessary number of components to model the data and therefore it is unnecessary to explicitly restrict the n...
Dilan Görür, Carl Edward Rasmussen
83
Voted
APWEB
2006
Springer
15 years 6 months ago
Building Content Clusters Based on Modelling Page Pairs
We give a new view on building content clusters from page pair models. We measure the heuristic importance within every two pages by computing the distance of their accessed positi...
Christoph Meinel, Long Wang 0002
IVC
2008
100views more  IVC 2008»
15 years 2 months ago
Attention can improve a simple model for object recognition
Object recognition is one of the most important tasks of the visual cortex. Even though it has been closely studied in the field of computer vision and neuroscience, the underlyin...
Edgar Bermudez Contreras, Hilary Buxton, Emmet Spi...
UC
2005
Springer
15 years 8 months ago
Lower Bounds on the Computational Power of an Optical Model of Computation
We present lower bounds on the computational power of an optical model of computation called the C2-CSM. We show that C2-CSM time is at least as powerful as sequential space, thus ...
Damien Woods, J. Paul Gibson
123
Voted
ENTCS
2011
131views more  ENTCS 2011»
14 years 9 months ago
Computational Complexity in Non-Turing Models of Computation: The What, the Why and the How
We preliminarily recap what is meant by complexity and non-Turing computation, by way of explanation of our title, ‘Computational Complexity in Non-Turing Models of Computationâ...
Ed Blakey