Sciweavers

2526 search results - page 208 / 506
» A New Algorithm for Answer Set Computation
Sort
View
MICS
2007
128views more  MICS 2007»
15 years 6 months ago
Structured Low Rank Approximation of a Bezout Matrix
The task of determining the approximate greatest common divisor (GCD) of more than two univariate polynomials with inexact coefficients can be formulated as computing for a given B...
Dongxia Sun, Lihong Zhi
CVPR
2011
IEEE
15 years 1 months ago
Submodularity beyond submodular energies: coupling edges in graph cuts
We propose a new family of non-submodular global energy functions that still use submodularity internally to couple edges in a graph cut. We show it is possible to develop an efï¬...
Stefanie Jegelka, Jeff Bilmes
DAC
2004
ACM
16 years 7 months ago
Fast statistical timing analysis handling arbitrary delay correlations
CT An efficient statistical timing analysis algorithm that can handle arbitrary (spatial and structural) causes of delay correlation is described. The algorithm derives the entire ...
Michael Orshansky, Arnab Bandyopadhyay
HVEI
2010
15 years 8 months ago
Efficient motion weighted spatio-temporal video SSIM index
Recently, Seshadrinathan and Bovik proposed the Motion-based Video Integrity Evaluation (MOVIE) index for VQA.1,2 MOVIE utilized a multi-scale spatio-temporal Gabor filter bank to...
Anush K. Moorthy, Alan C. Bovik
AAECC
2006
Springer
133views Algorithms» more  AAECC 2006»
15 years 6 months ago
On the low hamming weight discrete logarithm problem for nonadjacent representations
So-called nonadjacent representations are commonly used in elliptic curve cryptography to facilitate computing a scalar multiple of a point on an elliptic curve. A nonadjacent rep...
James A. Muir, Douglas R. Stinson