Sciweavers

534 search results - page 101 / 107
» Model Uncertainty in Classical Conditioning
Sort
View
SPAA
2004
ACM
14 years 1 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
NA
2007
147views more  NA 2007»
13 years 7 months ago
An adaptive spectral least-squares scheme for the Burgers equation
A least-squares spectral collocation method for the one-dimensional inviscid Burgers equation is proposed. This model problem shows the stability and high accuracy of these scheme...
Wilhelm Heinrichs
CORR
2012
Springer
179views Education» more  CORR 2012»
12 years 3 months ago
Distributional convergence for the number of symbol comparisons used by QuickSort
d Abstract) James Allen Fill1† 1 Department of Applied Mathematics and Statistics, The Johns Hopkins University, 34th and Charles Streets, Baltimore, MD 21218-2682 USA received 2...
James Allen Fill
ICDT
2009
ACM
248views Database» more  ICDT 2009»
14 years 8 months ago
Automatic verification of data-centric business processes
We formalize and study business process systems that are centered around "business artifacts", or simply "artifacts". This approach focuses on data records, kn...
Alin Deutsch, Richard Hull, Fabio Patrizi, Victor ...
BMCBI
2008
174views more  BMCBI 2008»
13 years 8 months ago
Evolutionary approaches for the reverse-engineering of gene regulatory networks: A study on a biologically realistic dataset
Background: Inferring gene regulatory networks from data requires the development of algorithms devoted to structure extraction. When only static data are available, gene interact...
Cédric Auliac, Vincent Frouin, Xavier Gidro...