Sciweavers

54 search results - page 3 / 11
» New Algorithms for Minimum Area k-gons
Sort
View
ISPD
2004
ACM
189views Hardware» more  ISPD 2004»
14 years 28 days ago
Almost optimum placement legalization by minimum cost flow and dynamic programming
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
Ulrich Brenner, Anna Pauli, Jens Vygen
JC
2002
63views more  JC 2002»
13 years 7 months ago
On the Complexity of Exclusion Algorithms for Optimization
Exclusion algorithms are a well-known tool in the area of interval analysis for finding all solutions of a system of nonlinear equations or for finding the global minimum of a fun...
Eugene L. Allgower, Melissa Erdmann, Kurt Georg
TASLP
2008
148views more  TASLP 2008»
13 years 7 months ago
A Minimum Distortion Noise Reduction Algorithm With Multiple Microphones
Abstract--The problem of noise reduction using multiple microphones has long been an active area of research. Over the past few decades, most efforts have been devoted to beamformi...
Jingdong Chen, Jacob Benesty, Yiteng Huang
STOC
2006
ACM
166views Algorithms» more  STOC 2006»
14 years 7 months ago
New upper and lower bounds for randomized and quantum local search
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
Shengyu Zhang
CORR
2010
Springer
120views Education» more  CORR 2010»
13 years 2 months ago
LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations
LRM-Trees are an elegant way to partition a sequence of values into sorted consecutive blocks, and to express the relative position of the first element of each block within a prev...
Jérémy Barbay, Johannes Fischer