Sciweavers

1684 search results - page 20 / 337
» The lexicographic decision function
Sort
View
ICCD
2006
IEEE
125views Hardware» more  ICCD 2006»
14 years 6 months ago
Partial Functional Manipulation Based Wirelength Minimization
—In-place flipping of rectangular blocks/cells can potentially reduce the wirelength of a floorplan/placement solution without changing the chip area, In a recent work [Hao 05], ...
Avijit Dutta, David Z. Pan
ICMCS
2006
IEEE
104views Multimedia» more  ICMCS 2006»
14 years 3 months ago
An Efficient Criterion for Mode Decision in H.264/AVC
In this paper, an efficient cost function for mode decision in H.264/AVC is proposed. The proposed cost function is based on integer transform coefficients, where the rate and the...
Yu-Kuang Tu, Jar-Ferr Yang, Ming-Ting Sun
ILP
2005
Springer
14 years 3 months ago
Predicate Selection for Structural Decision Trees
Abstract. We study predicate selection functions (also known as splitting rules) for structural decision trees and propose two improvements to existing schemes. The first is in cl...
Kee Siong Ng, John W. Lloyd
TCS
2002
13 years 9 months ago
Complexity measures and decision tree complexity: a survey
We discuss several complexity measures for Boolean functions: certi cate complexity, sensitivity, block sensitivity, and the degree of a representing or approximating polynomial. ...
Harry Buhrman, Ronald de Wolf
STOC
2006
ACM
107views Algorithms» more  STOC 2006»
14 years 10 months ago
On basing one-way functions on NP-hardness
We consider the possibility of basing one-way functions on NP-Hardness; that is, we study possible reductions from a worst-case decision problem to the task of average-case invert...
Adi Akavia, Oded Goldreich, Shafi Goldwasser, Dana...