Sciweavers

2131 search results - page 397 / 427
» A computational approximation to the AIXI model
Sort
View
179
Voted
CONCUR
2006
Springer
15 years 9 months ago
Minimization, Learning, and Conformance Testing of Boolean Programs
Boolean programs with recursion are convenient abstractions of sequential imperative programs, and can be represented as recursive state machines (RSMs) or pushdown automata. Motiv...
Viraj Kumar, P. Madhusudan, Mahesh Viswanathan
FGR
2006
IEEE
255views Biometrics» more  FGR 2006»
15 years 9 months ago
Incremental Kernel SVD for Face Recognition with Image Sets
Non-linear subspaces derived using kernel methods have been found to be superior compared to linear subspaces in modeling or classification tasks of several visual phenomena. Such...
Tat-Jun Chin, Konrad Schindler, David Suter
IFIPTCS
2000
15 years 9 months ago
An Index for Two Dimensional String Matching Allowing Rotations
We present an index to search a two-dimensional pattern of size m m in a two-dimensional text of size n n, even when the pattern appears rotated in the text. The index is based on ...
Kimmo Fredriksson, Gonzalo Navarro, Esko Ukkonen
SI3D
1995
ACM
15 years 9 months ago
Visual Navigation of Large Environments Using Textured Clusters
A visual navigation system is described which uses texture mapped primitives to represent clusters of objects to maintain high and approximately constant frame rates. In cases whe...
Paulo W. C. Maciel, Peter Shirley
STOC
1995
ACM
194views Algorithms» more  STOC 1995»
15 years 9 months ago
Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals
Genomes frequently evolve by reversals ␳(i, j) that transform a gene order ␲1 . . . ␲i␲iϩ1 . . . ␲jϪ1␲j . . . ␲n into ␲1 . . . ␲i␲jϪ1 . . . ␲iϩ1␲j . . ....
Sridhar Hannenhalli, Pavel A. Pevzner