Sciweavers

6149 search results - page 436 / 1230
» Revealing the programming process
Sort
View
ICA
2004
Springer
16 years 8 days ago
On the Strong Uniqueness of Highly Sparse Representations from Redundant Dictionaries
A series of recent results shows that if a signal admits a sufficiently sparse representation (in terms of the number of nonzero coefficients) in an “incoherent” dictionary, th...
Rémi Gribonval, Morten Nielsen
ICALP
1992
Springer
15 years 11 months ago
Barbed Bisimulation
This paper defines a probabilistic barbed congruence which turns out to coincide with observational equivalence in a probabilistic extension of CCS. Based on this coincidence resu...
Robin Milner, Davide Sangiorgi
CP
2006
Springer
15 years 10 months ago
Sports League Scheduling: Enumerative Search for Prob026 from CSPLib
This paper presents an enumerative approach for a sports league scheduling problem. This simple method can solve some instances involving a number T of teams up to 70 while the bes...
Jean-Philippe Hamiez, Jin-Kao Hao
APLAS
2005
ACM
15 years 9 months ago
A Parametric Model for the Analysis of Mobile Ambients
In this paper we propose a new parametric abstract finite model of Mobile Ambients able to express several properties on processes. The model can be used for the analysis of these...
Dino Distefano
CC
2006
Springer
176views System Software» more  CC 2006»
15 years 9 months ago
The CGiS Compiler-A Tool Demonstration
The CGiS programming language is designed to open up the parallel performance possibilities of graphics processing units (GPUs) to general purpose programmers. This tool demonstrat...
Philipp Lucas, Nicolas Fritz, Reinhard Wilhelm