Sciweavers

7 search results - page 1 / 2
» New Fastest Linearly Independent Transforms over GF(3)
Sort
View
ISMVL
2007
IEEE
82views Hardware» more  ISMVL 2007»
13 years 11 months ago
New Fastest Linearly Independent Transforms over GF(3)
New fastest linearly independent (LI) transforms for ternary functions are introduced in this paper. The transforms operate over Galois Field (3) (GF(3)) and have smaller computat...
Bogdan J. Falkowski, Cicilia C. Lozano, Tadeusz Lu...
ICALP
2010
Springer
13 years 7 months ago
Covering and Packing in Linear Space
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
Andreas Björklund, Thore Husfeldt, Petteri Ka...
JMLR
2010
102views more  JMLR 2010»
13 years 1 days ago
Efficient Algorithms for Conditional Independence Inference
The topic of the paper is computer testing of (probabilistic) conditional independence (CI) implications by an algebraic method of structural imsets. The basic idea is to transfor...
Remco R. Bouckaert, Raymond Hemmecke, Silvia Lindn...
ICALP
2010
Springer
13 years 10 months ago
Testing Non-uniform k-Wise Independent Distributions over Product Spaces
A discrete distribution D over Σ1 × · · · × Σn is called (non-uniform) k-wise independent if for any set of k indexes {i1, . . . , ik} and for any z1 ∈ Σi1 , . . . , zk ...
Ronitt Rubinfeld, Ning Xie
ASPDAC
2008
ACM
126views Hardware» more  ASPDAC 2008»
13 years 7 months ago
DPlace2.0: A stable and efficient analytical placement based on diffusion
Nowadays a placement problem often involves multi-million objects and excessive fixed blockages. We present a new global placement algorithm that scales well to the modern large-s...
Tao Luo, David Z. Pan