3708 search results - page 303 / 742 » Programming with C Exceptions |
172
click to vote
AUSAI
2004
Springer
16 years 1 days ago
2004
Springer
We propose a multivariate decision tree inference scheme by using the minimum message length (MML) principle (Wallace and Boulton, 1968; Wallace and Dowe, 1999). The scheme uses MM...
143
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
el Nondeterministic Abstractions in C++ Laurent Michel1 , Andrew See1 , and Pascal Van Hentenryck2 1 University of Connecticut, Storrs, CT 06269-2155 2 Brown University, Box 1910, ...
154
click to vote
MP
2007
15 years 6 months ago
2007
We present a practical approach to Anstreicher and Lee’s masked spectral bound for maximum-entropy sampling, and we describe favorable results that we have obtained with a Branch...
188
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
We describe the first algorithm to compute maximum flows in surface-embedded graphs in near-linear time. Specifically, given a graph embedded on a surface of genus g, with two spe...
180
click to vote
FOCS
2006
IEEE
16 years 21 days ago
2006
IEEE
An additive spanner of an unweighted undirected graph G with distortion d is a subgraph H such that for any two vertices u, v ∈ G, we have δH(u, v) ≤ δG(u, v) + d. For every...