Sciweavers

1410 search results - page 243 / 282
» Proving theorems by reuse
Sort
View
ENTCS
2007
137views more  ENTCS 2007»
13 years 10 months ago
Formal Sequentialization of Distributed Systems via Program Rewriting
Formal sequentialization is introduced as a rewriting process for the reduction of parallelism and internal communication statements of distributed imperative programs. It constru...
Miquel Bertran, Francesc-Xavier Babot, August Clim...
NECO
2008
170views more  NECO 2008»
13 years 10 months ago
Representational Power of Restricted Boltzmann Machines and Deep Belief Networks
Deep Belief Networks (DBN) are generative neural network models with many layers of hidden explanatory factors, recently introduced by Hinton et al., along with a greedy layer-wis...
Nicolas Le Roux, Yoshua Bengio
GC
2007
Springer
13 years 10 months ago
Precoloring Extension of Co-Meyniel Graphs
The pre-coloring extension problem consists, given a graph G and a set of nodes to which some colors are already assigned, in finding a coloring of G with the minimum number of co...
Vincent Jost, Benjamin Lévêque, Fr&ea...
PE
2008
Springer
108views Optimization» more  PE 2008»
13 years 10 months ago
Rate-optimal schemes for Peer-to-Peer live streaming
In this paper we consider the problem of sending data in real time from information sources to sets of receivers, using peer-to-peer communications. We consider several models of ...
Laurent Massoulié, Andrew Twigg
TCS
2008
13 years 9 months ago
On different generalizations of episturmian words
In this paper we study some classes of infinite words generalizing episturmian words, and analyse the relations occurring among such classes. In each case, the reversal operator R...
Michelangelo Bucci, Aldo de Luca, Alessandro De Lu...