Sciweavers

270 search results - page 31 / 54
» Generation From Under - And Overspecified Structures
Sort
View
ICASSP
2011
IEEE
14 years 2 months ago
Sparse decomposition of transformation-invariant signals with continuous basis pursuit
Consider the decomposition of a signal into features that undergo transformations drawn from a continuous family. Current methods discretely sample the transformations and apply s...
Chaitanya Ekanadham, Daniel Tranchina, Eero P. Sim...
AAAI
2012
13 years 1 months ago
Manifold Warping: Manifold Alignment over Time
Knowledge transfer is computationally challenging, due in part to the curse of dimensionality, compounded by source and target domains expressed using different features (e.g., do...
Hoa Trong Vu, Clifton Carey, Sridhar Mahadevan
USS
2008
15 years 1 months ago
Practical Symmetric Key Cryptography on Modern Graphics Hardware
Graphics processors are continuing their trend of vastly outperforming CPUs while becoming more general purpose. The latest generation of graphics processors have introduced the a...
Owen Harrison, John Waldron
CIAC
1994
Springer
148views Algorithms» more  CIAC 1994»
15 years 3 months ago
Efficient Reorganization of Binary Search Trees
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...
Micha Hofri, Hadas Shachnai
SIGMOD
2008
ACM
164views Database» more  SIGMOD 2008»
15 years 11 months ago
Relational-style XML query
We study the problem of querying relational data embedded in XML. Relational data can be represented by various tree structures in XML. However, current XML query methods, such as...
Taro L. Saito, Shinichi Morishita