Sciweavers

5608 search results - page 1045 / 1122
» On the Theory of Matchgate Computations
Sort
View
103
Voted
BIRTHDAY
2010
Springer
15 years 2 months ago
Inferring Loop Invariants Using Postconditions
One of the obstacles in automatic program proving is to obtain suitable loop invariants. The invariant of a loop is a weakened form of its postcondition (the loop's goal, als...
Carlo A. Furia, Bertrand Meyer
GECCO
2008
Springer
196views Optimization» more  GECCO 2008»
15 years 2 months ago
ADANN: automatic design of artificial neural networks
In this work an improvement of an initial approach to design Artificial Neural Networks to forecast Time Series is tackled, and the automatic process to design Artificial Neural N...
Juan Peralta, Germán Gutiérrez, Arac...
BIRTHDAY
2010
Springer
15 years 1 months ago
The Edge of Graph Transformation - Graphs for Behavioural Specification
The title of this paper, besides being a pun, can be taken to mean either the frontier of research in graph transformation, or the advantage of using graph transformation. To focus...
Arend Rensink
CVPR
2010
IEEE
15 years 1 months ago
Total Bregman divergence and its applications to shape retrieval
Shape database search is ubiquitous in the world of biometric systems, CAD systems etc. Shape data in these domains is experiencing an explosive growth and usually requires search...
Meizhu Liu, Baba C. Vemuri, Shun-ichi Amari, Frank...
SPAA
2010
ACM
15 years 1 months ago
On the bit communication complexity of randomized rumor spreading
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
Pierre Fraigniaud, George Giakkoupis
« Prev « First page 1045 / 1122 Last » Next »