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
[1]
Hilfe
Suche: Author="Sharma, Arun"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the data consumption benefits of accepting increased uncertainty
Eric Martin
,
Arun Sharma
,
Frank Stephan
Theoretical Computer Science
382
(3), 2007, pp. 170-182
Identifying clusters from positive data
John Case
,
Sanjay Jain
,
Eric Martin
,
Arun Sharma
,
Frank Stephan
SIAM Journal on Computing
36
(1), 2006, pp. 28-55
Unifying logic, topology and learning in parametric logic
Éric Martin
,
Arun Sharma
,
Frank Stephan
Theoretical Computer Science
350
(1), 2006, pp. 103-124
On ordinal VC-dimension and some notions of complexity
Eric Martin
,
Arun Sharma
,
Frank Stephan
Theoretical Computer Science
364
(1), 2006, pp. 62-76
On the classification of recursive languages
John Case
,
Efim Kinber
,
Arun Sharma
,
Frank Stephan
Information and Computation
192
(1), 2004, pp. 15-40
Generalized notions of mind change complexity
Arun Sharma
,
Frank Stephan
,
Yuri Ventsov
Information and Computation
189
(2), 2004, pp. 235-262
Learning power and language expressiveness
Eric Martin
,
Arun Sharma
,
Frank Stephan
Theoretical Computer Science
298
(2), 2003, pp. 365-383
Learning to win process-control games watching game-masters
John Case
,
Matthias Ott
,
Arun Sharma
,
Frank Stephan
Information and Computation
174
(1), 2002, pp. 1-19
Mind change complexity of learning logic programs
Sanjay Jain
,
Arun Sharma
Theoretical Computer Science
284
(1), 2002, pp. 143-160
Predictive learning models for concept drift
John Case
,
Sanjay Jain
,
Susanne Kaufmann
,
Arun Sharma
,
Frank Stephan
Theoretical Computer Science
268
(2), 2001, pp. 323-349
Synthesizing noise-tolerant language learners
John Case
,
Sanjay Jain
,
Arun Sharma
Theoretical Computer Science
261
(1), 2001, pp. 31-56
On a generalized notion of mistake bounds
Sanjay Jain
,
Arun Sharma
Information and Computation
166
(2), 2001, pp. 156-166
Approximating uniform triangular meshes in polygons
Franz Aurenhammer
,
Naoki Katoh
,
Hiromichi Kojima
,
Makoto Ohsaki
,
Yinfeng Xu
Lecture Notes in Computer Science
1858
, 2000, pp. 23-33
Better bounds on the accommodating ratio for the seat reservation problem
Eric Bach
,
Joan Boyar
,
Tao Jiang
,
Kim S. Larsen
,
Guo-Hui Lin
Lecture Notes in Computer Science
1858
, 2000, pp. 221-231
A duality between small-face problems in arrangements of lines and Heilbronn-type problems
Gill Barequet
Lecture Notes in Computer Science
1858
, 2000, pp. 44-53
Mappings for conflict-free access of paths in elementary data structures
Alan A. Bertossi
,
M. Cristina Pinotti
Lecture Notes in Computer Science
1858
, 2000, pp. 351-361
Recent progress and prospects for integer factorisation algorithms
Richard P. Brent
Lecture Notes in Computer Science
1858
, 2000, pp. 3-22
Robust learning aided by context
John Case
,
Sanjay Jain
,
Matthias Ott
,
Arun Sharma
,
Frank Stephan
Journal of Computer and System Sciences
60
(2), 2000, pp. 234-257
Hierarchical topological inference on planar disc maps
Zhi-Zhong Chen
,
Xin He
Lecture Notes in Computer Science
1858
, 2000, pp. 115-125
Approximation algorithms for independent sets in map graphs
Zhi-Zhong Chen
Lecture Notes in Computer Science
1858
, 2000, pp. 105-114
Learning from approximate data
Shirley Cheung H.C.
Lecture Notes in Computer Science
1858
, 2000, pp. 407-415
Optimal coding with one asymmetric error: Below the sphere packing bound
Ferdinando Cicalese
,
Daniele Mundici
Lecture Notes in Computer Science
1858
, 2000, pp. 159-169
On computation of arbitrage for markets with friction
Xiaotie Deng
,
Zhongfei Li
,
Shouyang Wang
Lecture Notes in Computer Science
1858
, 2000, pp. 310-319
Embedding problems for paths with direction constrained edges
Giuseppe Di Battista
,
Giuseppe Liotta
,
Anna Lubiw
,
Sue Whitesides
Lecture Notes in Computer Science
1858
, 2000, pp. 64-73
Removing complexity assumptions from concurrent zero-knowledge proofs
Giovanni Di Crescenzo
Lecture Notes in Computer Science
1858
, 2000, pp. 426-435
Seiten 1
2
3
4
>