Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND Volume=387
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Stochastic complexity for mixture of exponential families in generalized variational Bayes
Kazuho Watanabe
,
Sumio Watanabe
Theoretical Computer Science
387
(1), 2007, pp. 4-17
PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance
Nick Palmer
,
Paul W. Goldberg
Theoretical Computer Science
387
(1), 2007, pp. 18-31
Learning attribute-efficiently with corrupt oracles
Rotem Bennet
,
Nader H. Bshouty
Theoretical Computer Science
387
(1), 2007, pp. 32-50
A general comparison of language learning from examples and from queries
Sanjay Jain
,
Steffen Lange
,
Sandra Zilles
Theoretical Computer Science
387
(1), 2007, pp. 51-66
Learning multiple languages in groups
Sanjay Jain
,
Efim Kinber
Theoretical Computer Science
387
(1), 2007, pp. 67-76
Non-asymptotic calibration and resolution
Vladimir Vovk
Theoretical Computer Science
387
(1), 2007, pp. 77-89
Enumeration and generation with a string automata representation
Marco Almeida
,
Nelma Moreira
,
Rogério Reis
Theoretical Computer Science
387
(2), 2007, pp. 93-102
Regulated RNA rewriting: Modelling RNA editing with guided insertion
Franziska Biegler
,
Michael J. Burrell
,
Mark Daley
Theoretical Computer Science
387
(2), 2007, pp. 103-112
An infinite hierarchy induced by depth synchronization
Franziska Biegler
,
Ian McQuillan
,
Kai Salomaa
Theoretical Computer Science
387
(2), 2007, pp. 113-124
On the existence of regular approximations
Brendan Cordy
,
Kai Salomaa
Theoretical Computer Science
387
(2), 2007, pp. 125-135
On the number of components for some parallel communicating grammar systems
Jürgen Dassow
,
Bianca Truthe
Theoretical Computer Science
387
(2), 2007, pp. 136-146
Transition complexity of language operations
Michael Domaratzki
,
Kai Salomaa
Theoretical Computer Science
387
(2), 2007, pp. 147-154
On the average state and transition complexity of finite languages
Hermann Gruber
,
Markus Holzer
Theoretical Computer Science
387
(2), 2007, pp. 155-166
The size of Higman-Haines sets
Hermann Gruber
,
Markus Holzer
,
Martin Kutrib
Theoretical Computer Science
387
(2), 2007, pp. 167-176
Quantum automata for some multiperiodic languages
Carlo Mereghetti
,
Beatrice Palano
Theoretical Computer Science
387
(2), 2007, pp. 177-186
A complete characterization of deterministic regular liveness properties
Frank Nießner
,
Ulrich Ultes-Nitsche
Theoretical Computer Science
387
(2), 2007, pp. 187-195
Burrows-Wheeler compression: Principles and reflections
Peter Fenwick
Theoretical Computer Science
387
(3), 2007, pp. 200-219
A simpler analysis of Burrows-Wheeler-based compression
Haim Kaplan
,
Shir Landau
,
Elad Verbin
Theoretical Computer Science
387
(3), 2007, pp. 220-235
From first principles to the Burrows and Wheeler transform and beyond, via combinatorial optimization
R. Giancarlo
,
A. Restivo
,
M. Sciortino
Theoretical Computer Science
387
(3), 2007, pp. 236-248
Fast BWT in small space by blockwise suffix sorting
Juha Kärkkäinen
Theoretical Computer Science
387
(3), 2007, pp. 249-257
Faster suffix sorting
N. Jesper Larsson
,
Kunihiko Sadakane
Theoretical Computer Science
387
(3), 2007, pp. 258-272
Compressing table data with column dependency
Binh Dao Vo
,
Kiem-Phong Vo
Theoretical Computer Science
387
(3), 2007, pp. 273-283
Adaptive searching in succinctly encoded binary relations and tree-structured documents
Jérémy Barbay
,
Alexander Golynski
,
J. Ian Munro
,
S. Srinivasa Rao
Theoretical Computer Science
387
(3), 2007, pp. 284-297
An extension of the Burrows-Wheeler Transform
S. Mantaci
,
A. Restivo
,
G. Rosone
,
M. Sciortino
Theoretical Computer Science
387
(3), 2007, pp. 298-312
Compressed data structures: Dictionaries and data-aware measures
Ankur Gupta
,
Wing-Kai Hon
,
Rahul Shah
,
Jeffrey Scott Vitter
Theoretical Computer Science
387
(3), 2007, pp. 313-331
Seiten 1
2
>