154 search results - page 15 / 31 » Algorithms for Implicit Hitting Set Problems |
114
click to vote
SODA
2012
ACM
12 years 12 months ago
2012
ACM
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
110
Voted
3DIM
1997
IEEE
15 years 1 months ago
1997
IEEE
Geometric fusion of multiple sets of overlapping surface measurements is an important problem for complete 3D object or environment modelling. Fusion based on a discrete implicit ...
ISAAC
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. We define an algorithm for determining, in a linear number of symbolic steps, the biconnected components of a graph implicitly represented with Ordered Binary Decision D...
ICANN
2009
Springer
15 years 2 months ago
2009
Springer
Recurrent neural networks serve as black-box models for nonlinear dynamical systems identification and time series prediction. Training of recurrent networks typically minimizes t...
109
Voted
TNN
2008
14 years 9 months ago
2008
Hard-margin support vector machines (HM-SVMs) suffer from getting overfitting in the presence of noise. Soft-margin SVMs deal with this problem by introducing a regularization term...