Sciweavers

17541 search results - page 3118 / 3509
» Complexity in scalable computing
Sort
View
SIGMOD
2010
ACM
171views Database» more  SIGMOD 2010»
15 years 7 months ago
An optimal labeling scheme for workflow provenance using skeleton labels
We develop a compact and efficient reachability labeling scheme for answering provenance queries on workflow runs that conform to a given specification. Even though a workflow run...
Zhuowei Bao, Susan B. Davidson, Sanjeev Khanna, Su...
CLEF
2010
Springer
15 years 7 months ago
Random Sampling Image to Class Distance for Photo Annotation
Image classification or annotation is proved difficult for the computer algorithms. The Naive-Bayes Nearest Neighbor method is proposed to tackle the problem, and achieved the stat...
Deyuan Zhang, Bingquan Liu, Chengjie Sun, Xiaolong...
ICASSP
2010
IEEE
15 years 7 months ago
Robust regression using sparse learning for high dimensional parameter estimation problems
Algorithms such as Least Median of Squares (LMedS) and Random Sample Consensus (RANSAC) have been very successful for low-dimensional robust regression problems. However, the comb...
Kaushik Mitra, Ashok Veeraraghavan, Rama Chellappa
ICASSP
2010
IEEE
15 years 7 months ago
Fast signal analysis and decomposition on graphs using the Sparse Matrix Transform
Recently, the Sparse Matrix Transform (SMT) has been proposed as a tool for estimating the eigen-decomposition of high dimensional data vectors [1]. The SMT approach has two major...
Leonardo R. Bachega, Guangzhi Cao, Charles A. Boum...
ICASSP
2010
IEEE
15 years 7 months ago
Optimal delayed decoding of predictively encoded sources
Predictive coding eliminates redundancy due to correlations between the current and past signal samples, so that only the innovation, or prediction residual, needs to be encoded. ...
Vinay Melkote, Kenneth Rose
« Prev « First page 3118 / 3509 Last » Next »