1995 search results - page 114 / 399 » What's the Problem |
140
click to vote
LOGCOM
2008
15 years 3 months ago
2008
We look at the problem in belief revision of trying to make inferences about what an agent believed--or will believe--at a given moment, based on an observation of how the agent h...
130
click to vote
SIGARCH
2008
15 years 3 months ago
2008
This paper presents the OpenDF framework and recalls that dataflow programming was once invented to address the problem of parallel computing. We discuss the problems with an impe...
128
Voted
AIIA
2009
Springer
15 years 10 months ago
2009
Springer
This paper studies the following question: given an instance of the propositional satisfiability problem, a randomized satisfiability solver, and a cluster of n computers, what i...
126
Voted
CPM
2004
Springer
15 years 9 months ago
2004
Springer
Given a matrix X composed of symbols, a bicluster is a submatrix of X obtained by removing some of the rows and some of the columns of X in such a way that each row of what is lef...
128
Voted
TSP
2010
14 years 10 months ago
2010
Abstract--In this paper, we present a concise and coherent analysis of the constrained `1 minimization method for stable recovering of high-dimensional sparse signals both in the n...