Sciweavers

2100 search results - page 365 / 420
» Fundamentals of the problem
Sort
View
SIAMJO
2011
12 years 12 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...
CIKM
2011
Springer
12 years 9 months ago
Personalizing web search results by reading level
Traditionally, search engines have ignored the reading difficulty of documents and the reading proficiency of users in computing a document ranking. This is one reason why Web se...
Kevyn Collins-Thompson, Paul N. Bennett, Ryen W. W...
DCC
2006
IEEE
14 years 8 months ago
Compressed Data Structures: Dictionaries and Data-Aware Measures
Abstract. We propose measures for compressed data structures, in which space usage is measured in a data-aware manner. In particular, we consider the fundamental dictionary problem...
Ankur Gupta, Wing-Kai Hon, Rahul Shah, Jeffrey Sco...
OOPSLA
2009
Springer
14 years 3 months ago
Scalable nonblocking concurrent objects for mission critical code
The high degree of complexity and autonomy of future robotic space missions, such as Mars Science Laboratory (MSL), poses serious challenges in assuring their reliability and ef...
Damian Dechev, Bjarne Stroustrup
SIGIR
2009
ACM
14 years 3 months ago
CompositeMap: a novel framework for music similarity measure
With the continuing advances in data storage and communication technology, there has been an explosive growth of music information from different application domains. As an effe...
Bingjun Zhang, Jialie Shen, Qiaoliang Xiang, Ye Wa...