Sciweavers

CORR
2008
Springer
58views Education» more  CORR 2008»
13 years 4 months ago
Some results on (a:b)-choosability
A solution to a problem of Erdos, Rubin and Taylor is obtained by showing that if a graph G is (a : b)-choosable, and c/d > a/b, then G is not necessarily (c : d)-choosable. Th...
Shai Gutner, Michael Tarsi
CORR
2010
Springer
62views Education» more  CORR 2010»
13 years 4 months ago
Sequence prediction in realizable and non-realizable cases
A sequence x1, . . . , xn, . . . of discrete-valued observations is generated according to some unknown probabilistic law (measure)
Daniil Ryabko
CORR
2010
Springer
150views Education» more  CORR 2010»
13 years 4 months ago
Boosting Multi-Core Reachability Performance with Shared Hash Tables
Abstract--This paper focuses on data structures for multicore reachability, which is a key component in model checking algorithms and other verification methods. A cornerstone of a...
Alfons Laarman, Jaco van de Pol, Michael Weber 000...
CORR
2010
Springer
182views Education» more  CORR 2010»
13 years 4 months ago
Fast Convergence of Natural Bargaining Dynamics in Exchange Networks
Bargaining networks model the behavior of a set of players who need to reach pairwise agreements for making profits. Nash bargaining solutions in this context correspond to soluti...
Yashodhan Kanoria, Mohsen Bayati, Christian Borgs,...
CORR
2010
Springer
127views Education» more  CORR 2010»
13 years 4 months ago
MINRES-QLP: a Krylov subspace method for indefinite or singular symmetric systems
Abstract. CG, SYMMLQ, and MINRES are Krylov subspace methods for solving large symmetric systems of linear equations. CG (the conjugate-gradient method) is reliable on positive-def...
Sou-Cheng T. Choi, Christopher C. Paige, Michael A...
BMCBI
2008
211views more  BMCBI 2008»
13 years 4 months ago
CUDA compatible GPU cards as efficient hardware accelerators for Smith-Waterman sequence alignment
Background: Searching for similarities in protein and DNA databases has become a routine procedure in Molecular Biology. The Smith-Waterman algorithm has been available for more t...
Svetlin Manavski, Giorgio Valle
AUTOMATICA
2007
103views more  AUTOMATICA 2007»
13 years 4 months ago
Lexicographic perturbation for multiparametric linear programming with applications to control
Optimal control problems for constrained linear systems with a linear cost can be posed as multiparametric linear programs with a parameter in the cost, or equivalently the right-...
Colin Neil Jones, Eric C. Kerrigan, Jan M. Maciejo...
SMA
2010
ACM
164views Solid Modeling» more  SMA 2010»
13 years 4 months ago
Topologically guaranteed univariate solutions of underconstrained polynomial systems via no-loop and single-component tests
We present an algorithm which robustly computes the intersection curve(s) of an under-constrained piecewise polynomial system consisting of n equations with n + 1 unknowns. The so...
Michael Barton, Gershon Elber, Iddo Hanniel
ACL
1998
13 years 6 months ago
Separable Verbs in a Reusable Morphological Dictionary for German
Separable verbs are verbs with prefixes which, depending on the syntactic context, can occur as one word written together or discontinuously. They occur in languages such as Germa...
Pius ten Hacken, Stephan Bopp
USITS
2001
13 years 6 months ago
Dynamic Host Configuration for Managing Mobility Between Public and Private Networks
The usage and service options of a pubic network generally differ from a private (enterprise or home) network and consequently, the two networks are often configured differently. ...
Allen K. L. Miu, Paramvir Bahl