4377 search results - page 89 / 876 » Mass problems and randomness |
161
click to vote
ESA
1997
Springer
15 years 9 months ago
1997
Springer
In thispaper we introduce a new class of dynamicgraphalgorithmscalledquasi-fully dynamic algorithms,which are much more general than the backtracking algorithmsand are much simple...
179
click to vote
TEC
2008
15 years 4 months ago
2008
In this paper, we propose an evolutionary approach to the design of output codes for multiclass pattern recognition problems. This approach has the advantage of taking into account...
197
click to vote
ALT
2011
Springer
14 years 5 months ago
2011
Springer
We consider the problem of learning sparse parities in the presence of noise. For learning parities on r out of n variables, we give an algorithm that runs in time poly log 1 δ , ...
231
click to vote
ICPR
2010
IEEE
16 years 9 days ago
2010
IEEE
Many vision applications have been formulated as Markov Random Field (MRF) problems. Although many of them are discrete labeling problems, continuous formulation often achieves gre...
134
click to vote
FSEN
2009
Springer
16 years 21 hour ago
2009
Springer
Abstract. We analyze a model of fault-tolerant systems in a probabilistic setting. The model has been introduced under the name of “sabotage games”. A reachability problem over...