Sciweavers

935 search results - page 110 / 187
» A New Statistical Optimization Algorithm for Gate Sizing
Sort
View
IJCGA
2006
79views more  IJCGA 2006»
15 years 3 months ago
Well-constrained Completion and Decomposition for under-constrained Geometric Constraint Problems
In this paper, we consider the optimal well-constrained completion problem, that is, for an under-constrained geometric constraint problem, add automatically new constraints in suc...
Gui-Fang Zhang, Xiao-Shan Gao
STOC
2007
ACM
142views Algorithms» more  STOC 2007»
16 years 3 months ago
Lower bounds for randomized read/write stream algorithms
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
Paul Beame, T. S. Jayram, Atri Rudra
PPSN
2000
Springer
15 years 6 months ago
Optimizing through Co-evolutionary Avalanches
Abstract. We explore a new general-purpose heuristic for nding highquality solutions to hard optimization problems. The method, called extremal optimization, is inspired by self-or...
Stefan Boettcher, Allon G. Percus, Michelangelo Gr...
NETWORKING
2004
15 years 4 months ago
Scalable Packet Classification through Maximum Entropy Hashing
In this paper we propose a new packet classification algorithm, which can substantially improve the performance of a classifier by decreasing the rulebase lookup latency. The algor...
Lynn Choi, Jaesung Heo, Hyogon Kim, Jinoo Joung, S...
PR
2010
184views more  PR 2010»
15 years 1 months ago
Total variation, adaptive total variation and nonconvex smoothly clipped absolute deviation penalty for denoising blocky images
The total variation-based image denoising model has been generalized and extended in numerous ways, improving its performance in different contexts. We propose a new penalty func...
Aditya Chopra, Heng Lian