Sciweavers

1245 search results - page 104 / 249
» Binary Sparse Coding
Sort
View
ICCTA
2007
IEEE
15 years 7 months ago
What Graphs can be Efficiently Represented by BDDs?
We have carried out experimental research into implicit representation of large graphs using reduced ordered binary decision diagrams (OBDDs). We experimentally show that for grap...
Changxing Dong, Paul Molitor
DEXA
2006
Springer
80views Database» more  DEXA 2006»
15 years 7 months ago
Scalable Automated Service Composition Using a Compact Directory Digest
The composition of services that are indexed in a large-scale service directory often involves many complex queries issued by the service composition algorithm to the directory. Th...
Walter Binder, Ion Constantinescu, Boi Faltings
138
Voted
ICCV
2009
IEEE
1318views Computer Vision» more  ICCV 2009»
16 years 8 months ago
Non-Local Sparse Models for Image Restoration
We propose in this paper to unify two different ap- proaches to image restoration: On the one hand, learning a basis set (dictionary) adapted to sparse signal descriptions has p...
Julien Mairal, Francis Bach, Jean Ponce, Guillermo...
ICIP
2008
IEEE
16 years 5 months ago
Sparse orthonormal transforms for image compression
We propose a block-based transform optimization and associated image compression technique that exploits regularity along directional image singularities. Unlike established work,...
Osman Gokhan Sezer, Oztan Harmanci, Onur G. Gulery...
PPAM
2007
Springer
15 years 9 months ago
A Supernodal Out-of-Core Sparse Gaussian-Elimination Method
Abstract. We present an out-of-core sparse direct solver for unsymmetric linear systems. The solver factors the coefficient matrix A into A = PLU using Gaussian elimination with pa...
Sivan Toledo, Anatoli Uchitel