Sciweavers

2463 search results - page 40 / 493
» Compressing Pattern Databases
Sort
View
TSP
2010
13 years 2 months ago
LS-CS-residual (LS-CS): compressive sensing on least squares residual
We consider the problem of recursively and causally reconstructing time sequences of sparse signals (with unknown and time-varying sparsity patterns) from a limited number of noisy...
Namrata Vaswani
AUSDM
2008
Springer
235views Data Mining» more  AUSDM 2008»
13 years 9 months ago
ShrFP-Tree: An Efficient Tree Structure for Mining Share-Frequent Patterns
Share-frequent pattern mining discovers more useful and realistic knowledge from database compared to the traditional frequent pattern mining by considering the non-binary frequen...
Chowdhury Farhan Ahmed, Syed Khairuzzaman Tanbeer,...
ECAI
2008
Springer
13 years 9 months ago
Multi-valued Pattern Databases
Pattern Databases were a major breakthrough in heuristic search by solving hard combinatorial problems various orders of magnitude faster than state-of-the-art techniques at that ...
Carlos Linares López
CORR
2011
Springer
214views Education» more  CORR 2011»
12 years 11 months ago
Convex Approaches to Model Wavelet Sparsity Patterns
Statistical dependencies among wavelet coefficients are commonly represented by graphical models such as hidden Markov trees (HMTs). However, in linear inverse problems such as d...
Nikhil S. Rao, Robert D. Nowak, Stephen J. Wright,...
SERP
2007
13 years 9 months ago
Software Engineering Design Patterns for Relational Databases
– The use of design patterns such as the GRASP (General Responsibility Assignment Software Principles) or GoF (Gang-of-Four) patterns in software engineering has been well-docume...
Cyril S. Ku, Thomas J. Marlowe, Tatyana Budanskaya...