Sciweavers

7930 search results - page 1160 / 1586
» Greedy in Approximation Algorithms
Sort
View
ASPDAC
1999
ACM
77views Hardware» more  ASPDAC 1999»
15 years 11 months ago
Timing-Driven Bipartitioning with Replication Using Iterative Quadratic Programming
We present an algorithm for solving a general min-cut, twoway partitioning problem subject to timing constraints. The problem is formulated as a constrained programming problem an...
Shihliang Ou, Massoud Pedram
DCC
1999
IEEE
15 years 11 months ago
Embedded Post-Processing for Enhancement of Compressed Images
This paper presents a simple and e ective post-processing method for compressed images. This work focuses on the cyclic time-variance introduced by block-based and subband transfo...
Aria Nosratinia
SMI
1999
IEEE
108views Image Analysis» more  SMI 1999»
15 years 11 months ago
Modeling of Surfaces with Fair Reflection Line Pattern
Inspection of reflection line patterns is a standard way to check the quality of free form surfaces. In this paper, we describe an approach which enables the designer to control d...
Joachim Loos, Günther Greiner, Hans-Peter Sei...
MLDM
1999
Springer
15 years 11 months ago
Non-hierarchical Clustering with Rival Penalized Competitive Learning for Information Retrieval
In large content-based image database applications, e cient information retrieval depends heavily on good indexing structures of the extracted features. While indexing techniques f...
Irwin King, Tak-Kan Lau
173
Voted
STACS
1999
Springer
15 years 11 months ago
Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions
We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on efficient ...
Ming-Yang Kao, Andrzej Lingas, Anna Östlin
« Prev « First page 1160 / 1586 Last » Next »