Sciweavers

146 search results - page 27 / 30
» Testing Finitary Probabilistic Processes
Sort
View
TCS
2010
13 years 5 months ago
Runtime analysis of a binary particle swarm optimizer
We investigate the runtime of a Binary Particle Swarm Optimizer (PSO) for optimizing pseudo-Boolean functions f : {0, 1}n → R. The Binary PSO maintains a swarm of particles sear...
Dirk Sudholt, Carsten Witt
FASE
2006
Springer
13 years 11 months ago
Trace-Based Memory Aliasing Across Program Versions
One of the major costs of software development is associated with testing and validation of successive versions of software systems. An important problem encountered in testing and...
Murali Krishna Ramanathan, Suresh Jagannathan, Ana...
BMCBI
2010
118views more  BMCBI 2010»
13 years 7 months ago
Identifying differentially regulated subnetworks from phosphoproteomic data
Background: Various high throughput methods are available for detecting regulations at the level of transcription, translation or posttranslation (e.g. phosphorylation). Integrati...
Martin Klammer, Klaus Godl, Andreas Tebbe, Christo...
NIPS
2008
13 years 8 months ago
Natural Image Denoising with Convolutional Networks
We present an approach to low-level vision that combines two main ideas: the use of convolutional networks as an image processing architecture and an unsupervised learning procedu...
Viren Jain, H. Sebastian Seung
NIPS
1998
13 years 8 months ago
Facial Memory Is Kernel Density Estimation (Almost)
We compare the ability of three exemplar-based memory models, each using three different face stimulus representations, to account for the probability a human subject responded &q...
Matthew N. Dailey, Garrison W. Cottrell, Thomas A....