Sciweavers

7520 search results - page 467 / 1504
» Applications Development for the Computational Grid
Sort
View
FOSSACS
2006
Springer
15 years 10 months ago
Guessing Attacks and the Computational Soundness of Static Equivalence
The indistinguishability of two pieces of data (or two lists of pieces of data) can be represented formally in terms of a relation called static equivalence. Static equivalence dep...
Martín Abadi, Mathieu Baudet, Bogdan Warins...
GECCO
2008
Springer
156views Optimization» more  GECCO 2008»
15 years 8 months ago
Computing minimum cuts by randomized search heuristics
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
Frank Neumann, Joachim Reichel, Martin Skutella
AHS
2007
IEEE
202views Hardware» more  AHS 2007»
15 years 7 months ago
PERPLEXUS: Pervasive Computing Framework for Modeling Complex Virtually-Unbounded Systems
This paper introduces Perplexus, a European project that aims to develop a scalable hardware platform made of custom reconfigurable devices endowed with bio-inspired capabilities...
Eduardo Sanchez, Andrés Pérez-Uribe,...
ADHOC
2008
122views more  ADHOC 2008»
15 years 7 months ago
Balancing computation and communication costs: The case for hybrid execution in sensor networks
Virtual machines (VM) are promising as system software in sensor networks. A major impediment to their widespread acceptance is their performance overhead. Compiling VM bytecode to...
Joel Koshy, Ingwar Wirjawan, Raju Pandey, Yann Ram...
JCNS
2010
103views more  JCNS 2010»
15 years 1 months ago
Efficient computation of the maximum a posteriori path and parameter estimation in integrate-and-fire and more general state-spa
A number of important data analysis problems in neuroscience can be solved using state-space models. In this article, we describe fast methods for computing the exact maximum a pos...
Shinsuke Koyama, Liam Paninski