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: Author="Yang, T."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Image compression for fast wavelet-based subregion retrieval
A.S. Poulakidas
,
A. Srinivasan
,
Ö. Eğecioğlu
,
O. Ibarra
,
T. Yang
Theoretical Computer Science
240
(2), 2000, pp. 447-469
On minimum-area hulls
E.M. Arkin
,
Y.-J. Chiang
,
M. Held
,
J.S.B. Mitchell
,
V. Sacristan
,
S.S. Skiena
,
T.-C. Yang
Algorithmica
21
(1), 1998, pp. 119-136
A compact storage scheme for fast wavelet-based subregion retrieval
A.S. Poulakidas
,
A. Srinivasan
,
O. Egecioglu
,
O. Ibarra
,
T. Yang
Lecture Notes in Computer Science
1276
, 1997, pp. 353-362
Simple quantitative experiments with a sparse compiler
Aart J.C. Bik
,
Harry A.G. Wijshoff
Lecture Notes in Computer Science
1117
, 1996, pp. 249-262
Using algorithmic skeletons with dynamic data structures
George Horatiu Botorog
,
Herbert Kuchen
Lecture Notes in Computer Science
1117
, 1996, pp. 263-276
Decomposing irregularly sparse matrices for parallel matrix-vector multiplication
Ümit V. Çatalyürek
,
Cevdet Aykanat
Lecture Notes in Computer Science
1117
, 1996, pp. 75-86
Manufacturing progressive addition lenses using distributed parallel processing
José M. Cela
,
Juan C. Dürsteler
,
Jesús Labarta
Lecture Notes in Computer Science
1117
, 1996, pp. 339-350
Distributed object oriented data structures and algorithms for VLSI CAD
John A. Chandy
,
Steven Parkes
,
Prithviraj Banerjee
Lecture Notes in Computer Science
1117
, 1996, pp. 147-158
Fast distributed genetic algorithms for partitioning uniform grids
Ioannis T. Christou
,
Robert R. Meyer
Lecture Notes in Computer Science
1117
, 1996, pp. 89-103
Solution of large, sparse, irregular systems on a massively parallel computer
Will Dearholt
,
Steven Castillo
,
Gary Hennigan
Lecture Notes in Computer Science
1117
, 1996, pp. 49-62
Parallel implementation of a sparse approximate inverse preconditioner
Vaibhav Deshpande
,
Marcus J. Grote
,
Peter Messmer
,
William Sawyer
Lecture Notes in Computer Science
1117
, 1996, pp. 63-74
Synchronization as a strategy for designing efficient parallel algorithms
Claude G. Diderich
,
Marc Gengler
Lecture Notes in Computer Science
1117
, 1996, pp. 229-236
Towards efficient unstructured multigrid preprocessing
Susan E. Dorward
,
Lesley R. Matheson
,
Robert E. Tarjan
Lecture Notes in Computer Science
1117
, 1996, pp. 105-118
Domain decomposition for particle methods on the sphere
Ömer Eğecioğlu
,
Ashok Srinivasan
Lecture Notes in Computer Science
1117
, 1996, pp. 119-130
Coordination of distributed/parallel multiple-grid domain decomposition
C.T.H. Everaars
,
F. Arbab
Lecture Notes in Computer Science
1117
, 1996, pp. 131-144
Flexible communication mechanisms for dynamic structured applications
Stephen J. Fink
,
Scott B. Baden
,
Scott R. Kohn
Lecture Notes in Computer Science
1117
, 1996, pp. 203-215
Multi-message multicasting
Teofilo F. Gonzalez
Lecture Notes in Computer Science
1117
, 1996, pp. 217-228
The parallel complexity of randomized fractals
Raymond Greenlaw
,
Jonathan Machta
Lecture Notes in Computer Science
1117
, 1996, pp. 351-356
On the complexity of the generalized block distribution
Michelangelo Grigni
,
Fredrik Manne
Lecture Notes in Computer Science
1117
, 1996, pp. 319-326
Allocating independent tasks to parallel processors: An experimental study
Torben Hagerup
Lecture Notes in Computer Science
1117
, 1996, pp. 1-33
Efficient dynamic embedding of arbitrary binary trees into hypercubes
Volker Heun
,
Ernst W. Mayr
Lecture Notes in Computer Science
1117
, 1996, pp. 287-298
Lineal feature extraction by parallel stick growing
Galen C. Hunt
,
Randal C. Nelson
Lecture Notes in Computer Science
1117
, 1996, pp. 171-182
The module allocation problem: An average case analysis
M. Lamari
,
W. Fernandez de la Vega
Lecture Notes in Computer Science
1117
, 1996, pp. 307-312
Adaptive load balancing of irregular applications - A case study: IDA* applied to the 15-puzzle problem
N. Melab
,
N. Devesa
,
M.P. Lecouffe
,
B. Toursel
Lecture Notes in Computer Science
1117
, 1996, pp. 327-338
Supporting dynamic data and processor repartitioning for irregular applications
José E. Moreira
,
Kalluri Eswar
,
Ravi B. Konuru
,
Vijay K. Naik
Lecture Notes in Computer Science
1117
, 1996, pp. 237-248
Seiten 1
2
>