Sciweavers

16430 search results - page 296 / 3286
» On Computable Tree Functions
Sort
View
ICPR
2008
IEEE
16 years 6 months ago
Randomized trees for real-time one-step face detection and recognition
We present a system for detecting and recognizing faces in images in real-time which is able to learn new identities in instants. In mobile service robotics, interaction with pers...
Stefan Schiffer 0002, Thomas Deselaers, Vaishak Be...
WG
2004
Springer
15 years 10 months ago
Planar Graphs, via Well-Orderly Maps and Trees
The family of well-orderly maps is a family of planar maps with the property that every connected planar graph has at least one plane embedding which is a well-orderly map. We show...
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse,...
BIRTHDAY
2010
Springer
15 years 8 months ago
From Nondeterministic Suffix Automaton to Lazy Suffix Tree
Given two strings, a pattern P of length m and a text T of length n over some alphabet of size , we consider the exact string matching problem, i.e. we want to report all occurren...
Kimmo Fredriksson
ACL
2012
13 years 7 months ago
MIX Is Not a Tree-Adjoining Language
The language MIX consists of all strings over the three-letter alphabet {a, b, c} that contain an equal number of occurrences of each letter. We prove Joshi’s (1985) conjecture ...
Makoto Kanazawa, Sylvain Salvati
LICS
2005
IEEE
15 years 10 months ago
A Functional Quantum Programming Language
We introduce the language QML, a functional language for quantum computations on finite types. Its design is guided by its categorical semantics: QML programs are interpreted by ...
Thorsten Altenkirch, Jonathan Grattage