Sciweavers

439 search results - page 51 / 88
» An Improved Analysis of Linear Mergers
Sort
View
AGP
1999
IEEE
15 years 3 months ago
Widening Sharing
We study the problem of an efficient and precise sharing analysis of (constraint) logic programs. After recognizing that neither aring nor its non-redundant (but equivalent) abstra...
Enea Zaffanella, Roberto Bagnara, Patricia M. Hill
ISQED
2008
IEEE
153views Hardware» more  ISQED 2008»
15 years 5 months ago
Accelerating Clock Mesh Simulation Using Matrix-Level Macromodels and Dynamic Time Step Rounding
Clock meshes have found increasingly wide applications in today’s high-performance IC designs. The inherent routing redundancies associated with clock meshes lead to improved cl...
Xiaoji Ye, Min Zhao, Rajendran Panda, Peng Li, Jia...
ECCV
2004
Springer
16 years 25 days ago
Dimensionality Reduction by Canonical Contextual Correlation Projections
A linear, discriminative, supervised technique for reducing feature vectors extracted from image data to a lower-dimensional representation is proposed. It is derived from classica...
Marco Loog, Bram van Ginneken, Robert P. W. Duin
ICIP
2008
IEEE
15 years 5 months ago
Detection of +/-1 LSB steganography based on the amplitude of histogram local extrema
Recently Zhang et al described an algorithm for the detection of ±1 LSB steganography based on the statistics of the amplitudes of local extrema in the greylevel histogram. Exper...
Giacomo Cancelli, Gwenaël J. Doërr, Inge...
VALUETOOLS
2006
ACM
176views Hardware» more  VALUETOOLS 2006»
15 years 4 months ago
How to solve large scale deterministic games with mean payoff by policy iteration
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
Vishesh Dhingra, Stephane Gaubert