Sciweavers

2061 search results - page 76 / 413
» The continuous knapsack set
Sort
View
CONCUR
2008
Springer
14 years 11 months ago
Dynamic Partial Order Reduction Using Probe Sets
We present an algorithm for partial order reduction in the context of a countable universe of deterministic actions, of which finitely many are enabled at any given state. This mea...
Harmen Kastenberg, Arend Rensink
NAR
2011
158views Computer Vision» more  NAR 2011»
14 years 20 days ago
T1DBase: update 2011, organization and presentation of large-scale data sets for type 1 diabetes research
T1DBase (http://www.t1dbase.org) is web platform, which supports the type 1 diabetes (T1D) community. It integrates genetic, genomic and expression data relevant to T1D research a...
Oliver S. Burren, Ellen C. Adlem, Premanand Achuth...
80
Voted
SIAMJO
2008
85views more  SIAMJO 2008»
14 years 9 months ago
Explicit Reformulations for Robust Optimization Problems with General Uncertainty Sets
We consider a rather general class of mathematical programming problems with data uncertainty, where the uncertainty set is represented by a system of convex inequalities. We prove...
Igor Averbakh, Yun-Bin Zhao
TIP
2010
188views more  TIP 2010»
14 years 8 months ago
On-line Learning of Mutually Orthogonal Subspaces for Face Recognition by Image Sets
—We address the problem of face recognition by matching image sets. Each set of face images is represented by a subspace (or linear manifold) and recognition is carried out by su...
Tae-Kyun Kim, Josef Kittler, Roberto Cipolla
ICPPW
2005
IEEE
15 years 3 months ago
Factoring Solution Sets of Polynomial Systems in Parallel
We report on a £rst parallel implementation of a recent algorithm to factor positive dimensional solution sets of polynomial systems. As the algorithm uses homotopy continuation,...
Anton Leykin, Jan Verschelde