4966 search results - page 202 / 994 » its 2010 |
137
click to vote
ICASSP
2010
IEEE
15 years 6 months ago
2010
IEEE
We present a new algorithm for bound-constrained totalvariation (TV) regularization that in comparison with its predecessors is simple, fast, and flexible. We use a splitting app...
169
click to vote
EUROPAR
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. In this paper we consider the problem of scheduling on computing platforms composed of several independent organizations, known as the Multi-Organization Scheduling Probl...
147
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Let G = (V, E) be any undirected graph on V vertices and E edges. A path P between any two vertices u, v V is said to be t-approximate shortest path if its length is at most t tim...
127
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We consider the problem of deciding whether a highly incomplete signal lies within a given subspace. This problem, Matched Subspace Detection, is a classical, wellstudied problem w...
177
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The signcryption is a relatively new cryptographic technique that is supposed to fulfill the functionalities of encryption and digital signature in a single logical step. Several ...