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="Takimoto, Eiji"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Size-energy tradeoffs for unate circuits computing symmetric Boolean functions
Kei Uchizawa
,
Eiji Takimoto
,
Takao Nishizeki
Theoretical Computer Science
412
(8-10), 2011, pp. 773-782
Lower bounds for linear decision trees via an energy complexity argument
Kei Uchizawa
,
Eiji Takimoto
Lecture Notes in Computer Science
6907
, 2011, pp. 568-579
Online linear optimization over permutations
Shota Yasutake
,
Kohei Hatano
,
Shuji Kijima
,
Eiji Takimoto
,
Masayuki Takeda
Lecture Notes in Computer Science
7074
, 2011, pp. 534-543
Energy and depth of threshold circuits
Kei Uchizawa
,
Takao Nishizeki
,
Eiji Takimoto
Theoretical Computer Science
411
(44-46), 2010, pp. 3938-3946
Size and energy of threshold circuits computing Mod functions
Kei Uchizawa
,
Takao Nishizeki
,
Eiji Takimoto
Lecture Notes in Computer Science
5734
, 2009, pp. 724-735
Monotone DNF formula that has a minimal or maximal number of satisfying assignments
Takayuki Sato
,
Kazuyuki Amano
,
Eiji Takimoto
,
Akira Maruoka
Lecture Notes in Computer Science
5092
, 2008, pp. 191-203
Monotone DNF formula that has a minimal or maximal number of satisfying assignments
Takayuki Sato
,
Kazuyuki Amano
,
Eiji Takimoto
,
Akira Maruoka
Lecture Notes in Computer Science
5092
, 2008, pp. 191-203
Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity
Kei Uchizawa
,
Eiji Takimoto
Theoretical Computer Science
407
(1-3), 2008, pp. 474-487
Aggregating strategy for online auctions
Shigeaki Harada
,
Eiji Takimoto
,
Akira Maruoka
Lecture Notes in Computer Science
4112
, 2006, pp. 33-41
Top-down decision tree learning as information based boosting
Eiji Takimoto
,
Akira Maruoka
Theoretical Computer Science
292
(2), 2003, pp. 447-464
Predicting nearly as well as the best pruning of a planar decision graph
Eiji Takimoto
,
Manfred K. Warmuth
Theoretical Computer Science
288
(2), 2002, pp. 217-235
Algorithmic learning theory
Akira Maruoka
,
Eiji Takimoto
Encyclopedia of Computer Science and Technology
45
(Supplement 30), 2001, pp. 1-43
Predicting nearly as well as the best pruning of a decision tree through dynamic programming scheme
Eiji Takimoto
,
Akira Maruoka
,
Volodya Vovk
Theoretical Computer Science
261
(1), 2001, pp. 179-209
The learnability of exclusive-or expansions based on monotone DNF formulas
Eiji Takimoto
,
Yoshifumi Sakai
,
Akira Maruoka
Theoretical Computer Science
241
(1-2), 2000, pp. 37-50
Closures on COPs form complete lattices
Yoshifumi Sakai
,
Eiji Takimoto
,
Akira Maruoka
Information and Computation
152
(2), 1999, pp. 188-204
Learning orthogonal
F
-Horn formulas
Eiji Takimoto
,
Akira Miyashiro
,
Akira Maruoka
,
Yoshifumi Sakai
Theoretical Computer Science
185
(1), 1997, pp. 177-190