Sciweavers

849 search results - page 28 / 170
» On the Complexity of the Whitehead Minimization Problem
Sort
View
ISAAC
1995
Springer
135views Algorithms» more  ISAAC 1995»
13 years 11 months ago
The I/O - Complexity of Ordered Binary - Decision Diagram Manipulation
Ordered Binary-Decision Diagrams (OBDD) are the state-of-the-art data structure for boolean function manipulation and there exist several software packages for OBDD manipulation. ...
Lars Arge
CVPR
2010
IEEE
14 years 1 months ago
Fast Sparse Representation with Prototypes
Sparse representation has found applications in numerous domains and recent developments have been focused on the convex relaxation of the 0-norm minimization for sparse coding (i...
Jia-Bin Huang, Ming-Hsuan Yang
INFOCOM
1999
IEEE
14 years 1 days ago
Key Management for Secure Internet Multicast Using Boolean Function Minimization Techniques
Abstract-The Internet today provides no support for privacy or authentication of multicast packets. However,an increasing number of applications will require secure multicast servi...
Isabella Chang, Robert Engel, Dilip D. Kandlur, Di...
CC
2008
Springer
193views System Software» more  CC 2008»
13 years 9 months ago
Automatic Transformations for Communication-Minimized Parallelization and Locality Optimization in the Polyhedral Model
The polyhedral model provides powerful abstractions to optimize loop nests with regular accesses. Affine transformations in this model capture a complex sequence of execution-reord...
Uday Bondhugula, Muthu Manikandan Baskaran, Sriram...
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
14 years 8 months ago
Finding, minimizing, and counting weighted subgraphs
d Abstract] Virginia Vassilevska School of Mathematics Institute for Advanced Study Princeton, NJ 08540 USA virgi@math.ias.edu Ryan Williams School of Mathematics Institute for Adv...
Virginia Vassilevska, Ryan Williams