Sciweavers

8196 search results - page 1363 / 1640
» Computational Modeling and Complexity Science
Sort
View
MMB
2010
Springer
194views Communications» more  MMB 2010»
15 years 9 months ago
Searching for Tight Performance Bounds in Feed-Forward Networks
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
Andreas Kiefer, Nicos Gollan, Jens B. Schmitt
ASIACRYPT
2007
Springer
15 years 8 months ago
Simple and Efficient Perfectly-Secure Asynchronous MPC
Secure multi-party computation (MPC) allows a set of n players to securely compute an agreed function of their inputs, even when up to t players are under the control of an adversa...
Zuzana Beerliová-Trubíniová, ...
163
Voted
DAC
2006
ACM
15 years 6 months ago
Systematic software-based self-test for pipelined processors
Software-based self-test (SBST) has recently emerged as an effective methodology for the manufacturing test of processors and other components in systems-on-chip (SoCs). By moving ...
Mihalis Psarakis, Dimitris Gizopoulos, Miltiadis H...
BIOINFORMATICS
2008
172views more  BIOINFORMATICS 2008»
15 years 4 months ago
Fitting a geometric graph to a protein-protein interaction network
Motivation: Finding a good network null model for protein-protein interaction (PPI) networks is a fundamental issue. Such a model would provide insights into the interplay between...
Desmond J. Higham, Marija Rasajski, Natasa Przulj
CVPR
2003
IEEE
16 years 6 months ago
Shedding Light on the Weather
Virtually all methods in image processing and computer vision, for removing weather effects from images, assume single scattering of light by particles in the atmosphere. In reali...
Srinivasa G. Narasimhan, Shree K. Nayar
« Prev « First page 1363 / 1640 Last » Next »