Sciweavers

1582 search results - page 218 / 317
» On sparse signal representations
Sort
View
IDA
2002
Springer
15 years 6 months ago
Optimization of association rule mining queries
Levelwise algorithms (e.g., the Apriori algorithm) have been proved eective for association rule mining from sparse data. However, in many practical applications, the computation ...
Baptiste Jeudy, Jean-François Boulicaut
NA
2011
296views Computer Vision» more  NA 2011»
15 years 1 months ago
Rational approximation to the Fermi-Dirac function with applications in density functional theory
We are interested in computing the Fermi-Dirac matrix function in which the matrix argument is the Hamiltonian matrix arising from Density Function Theory (DFT) applications. More...
Roger B. Sidje, Yousef Saad
TOG
2012
237views Communications» more  TOG 2012»
13 years 9 months ago
An algebraic model for parameterized shape editing
We present an approach to high-level shape editing that adapts the structure of the shape while maintaining its global characteristics. Our main contribution is a new algebraic mo...
Martin Bokeloh, Michael Wand, Hans-Peter Seidel, V...
ACL
2012
13 years 9 months ago
Attacking Parsing Bottlenecks with Unlabeled Data and Relevant Factorizations
Prepositions and conjunctions are two of the largest remaining bottlenecks in parsing. Across various existing parsers, these two categories have the lowest accuracies, and mistak...
Emily Pitler
ICA
2012
Springer
14 years 2 months ago
On Revealing Replicating Structures in Multiway Data: A Novel Tensor Decomposition Approach
A novel tensor decomposition called pattern or P-decomposition is proposed to make it possible to identify replicating structures in complex data, such as textures and patterns in ...
Anh Huy Phan, Andrzej Cichocki, Petr Tichavsk&yacu...