Sciweavers

32032 search results - page 6390 / 6407
» Verified programming in Guru
Sort
View
SIAMJO
2011
12 years 9 months ago
Rank-Sparsity Incoherence for Matrix Decomposition
Suppose we are given a matrix that is formed by adding an unknown sparse matrix to an unknown low-rank matrix. Our goal is to decompose the given matrix into its sparse and low-ran...
Venkat Chandrasekaran, Sujay Sanghavi, Pablo A. Pa...
SIGMETRICS
2011
ACM
245views Hardware» more  SIGMETRICS 2011»
12 years 9 months ago
Record and transplay: partial checkpointing for replay debugging across heterogeneous systems
Software bugs that occur in production are often difficult to reproduce in the lab due to subtle differences in the application environment and nondeterminism. To address this pr...
Dinesh Subhraveti, Jason Nieh
SIGMOD
2011
ACM
210views Database» more  SIGMOD 2011»
12 years 9 months ago
A platform for scalable one-pass analytics using MapReduce
Today’s one-pass analytics applications tend to be data-intensive in nature and require the ability to process high volumes of data efficiently. MapReduce is a popular programm...
Boduo Li, Edward Mazur, Yanlei Diao, Andrew McGreg...
ICCV
2011
IEEE
12 years 6 months ago
Informative Feature Selection for Object Recognition via Sparse PCA
Bag-of-words (BoW) methods are a popular class of object recognition methods that use image features (e.g., SIFT) to form visual dictionaries and subsequent histogram vectors to r...
Nikhil Naikal, Allen Y. Yang, S. Shankar Sastry
CADE
2011
Springer
12 years 6 months ago
Experimenting with Deduction Modulo
Deduction modulo is a generic framework to describe proofs in a theory better than using raw axioms. This is done by presenting the theory through rules rewriting terms and proposi...
Guillaume Burel
« Prev « First page 6390 / 6407 Last » Next »