Sciweavers

2877 search results - page 349 / 576
» The Complexity of Planarity Testing
Sort
View
IJON
2007
74views more  IJON 2007»
15 years 4 months ago
Visual object concept discovery: Observations in congenitally blind children, and a computational approach
Over the course of the first few months of life, our brains accomplish a remarkable feat. They are able to interpret complex visual images so that instead of being just disconnec...
Jake V. Bouvrie, Pawan Sinha
PROPERTYTESTING
2010
15 years 2 months ago
Sublinear Algorithms in the External Memory Model
We initiate the study of sublinear-time algorithms in the external memory model [Vit01]. In this model, the data is stored in blocks of a certain size B, and the algorithm is char...
Alexandr Andoni, Piotr Indyk, Krzysztof Onak, Roni...
TNN
2010
234views Management» more  TNN 2010»
14 years 11 months ago
Novel maximum-margin training algorithms for supervised neural networks
This paper proposes three novel training methods, two of them based on the back-propagation approach and a third one based on information theory for Multilayer Perceptron (MLP) bin...
Oswaldo Ludwig, Urbano Nunes
BMCBI
2011
14 years 11 months ago
PhyloSim - Monte Carlo simulation of sequence evolution in the R statistical computing environment
Background: The Monte Carlo simulation of sequence evolution is routinely used to assess the performance of phylogenetic inference methods and sequence alignment algorithms. Progr...
Botond Sipos, Tim Massingham, Gregory E. Jordan, N...
ICALP
2009
Springer
16 years 5 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner