Sciweavers

429 search results - page 67 / 86
» Turing computations on ordinals
Sort
View
CSDA
2006
98views more  CSDA 2006»
14 years 9 months ago
Fast estimation algorithm for likelihood-based analysis of repeated categorical responses
Likelihood-based marginal regression modelling for repeated, or otherwise clustered, categorical responses is computationally demanding. This is because the number of measures nee...
Jukka Jokinen
ICPR
2010
IEEE
14 years 7 months ago
Rectifying Non-Euclidean Similarity Data Using Ricci Flow Embedding
Similarity based pattern recognition is concerned with the analysis of patterns that are specified in terms of object dissimilarity or proximity rather than ordinal values. For man...
Weiping Xu, Edwin R. Hancock, Richard C. Wilson
LPAR
2005
Springer
15 years 3 months ago
The Four Sons of Penrose
Abstract. We distill Penrose’s argument against the “artificial intelligence premiss”, and analyze its logical alternatives. We then clarify the different positions one can...
Nachum Dershowitz
CORR
2007
Springer
88views Education» more  CORR 2007»
14 years 9 months ago
Decisive Markov Chains
We consider qualitative and quantitative verification problems for infinite-state Markov chains. We call a Markov chain decisive w.r.t. a given set of target states F if it almos...
Parosh Aziz Abdulla, Noomene Ben Henda, Richard Ma...
66
Voted
ATAL
2009
Springer
15 years 4 months ago
Of robot ants and elephants
Investigations of multi-robot systems often make implicit assumptions concerning the computational capabilities of the robots. Despite the lack of explicit attention to the comput...
Asaf Shiloni, Noa Agmon, Gal A. Kaminka