Sciweavers

1064 search results - page 82 / 213
» Exact Algorithms for the Quadratic Linear Ordering Problem
Sort
View
PODS
2011
ACM
220views Database» more  PODS 2011»
14 years 7 months ago
Maximizing conjunctive views in deletion propagation
In deletion propagation, tuples from the database are deleted in order to reflect the deletion of a tuple from the view. Such an operation may result in the (often necessary) del...
Benny Kimelfeld, Jan Vondrák, Ryan Williams
ASPDAC
2000
ACM
159views Hardware» more  ASPDAC 2000»
15 years 8 months ago
Analytical minimization of half-perimeter wirelength
Global placement of hypergraphs is critical in the top-down placement of large timing-driven designs 10, 16 . Placement quality is evaluated in terms of the half-perimeter wirelen...
Andrew A. Kennings, Igor L. Markov
131
Voted
CISS
2010
IEEE
14 years 7 months ago
Frame permutation quantization
—Frame permutation quantization (FPQ) is a new vector quantization technique using finite frames. In FPQ, a vector is encoded using a permutation source code to quantize its fra...
Ha Quy Nguyen, Vivek K. Goyal, Lav R. Varshney
CRYPTO
2004
Springer
86views Cryptology» more  CRYPTO 2004»
15 years 9 months ago
On Multiple Linear Approximations
In this paper we study the long standing problem of information extraction from multiple linear approximations. We develop a formal statistical framework for block cipher attacks b...
Alex Biryukov, Christophe De Cannière, Mich...
VLDB
2006
ACM
162views Database» more  VLDB 2006»
16 years 4 months ago
Dependency trees in sub-linear time and bounded memory
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
Dan Pelleg, Andrew W. Moore