Sciweavers

6409 search results - page 373 / 1282
» A Computational Algorithm for Origami Design
Sort
View
DAC
2002
ACM
16 years 7 months ago
Guaranteed passive balancing transformations for model order reduction
The major concerns in state-of-the-art model reduction algorithms are: achieving accurate models of sufficiently small size, numerically stable and efficient generation of the mod...
Joel R. Phillips, Luca Daniel, Luis Miguel Silveir...
268
Voted
ICCV
2011
IEEE
14 years 6 months ago
Perturb-and-MAP Random Fields: Using Discrete Optimization\\to Learn and Sample from Energy Models
We propose a novel way to induce a random field from an energy function on discrete labels. It amounts to locally injecting noise to the energy potentials, followed by finding t...
George Papandreou, Alan L. Yuille
CVPR
2012
IEEE
13 years 9 months ago
Unsupervised feature learning framework for no-reference image quality assessment
In this paper, we present an efficient general-purpose objective no-reference (NR) image quality assessment (IQA) framework based on unsupervised feature learning. The goal is to...
Peng Ye, Jayant Kumar, Le Kang, David S. Doermann
DAC
2010
ACM
15 years 10 months ago
Eyecharts: constructive benchmarking of gate sizing heuristics
—Discrete gate sizing is one of the most commonly used, flexible, and powerful techniques for digital circuit optimization. The underlying problem has been proven to be NP-hard ...
Puneet Gupta, Andrew B. Kahng, Amarnath Kasibhatla...
ISPD
2005
ACM
221views Hardware» more  ISPD 2005»
16 years 9 days ago
Kraftwerk: a versatile placement approach
During the ispd05 placement contest, we employed the forcedirected approach Kraftwerk for global placement complemented by the network-flow based final placer Domino. These powe...
Bernd Obermeier, Hans Ranke, Frank M. Johannes