6315 search results - page 457 / 1263 » Approximating Solution Structure |
209
click to vote
CBSE
2004
Springer
16 years 1 months ago
2004
Springer
: In distributed and mobile environments, the connections among the hosts on which a software system is running are often unstable. As a result of connectivity losses, the overall ...
196
click to vote
ICDM
2003
IEEE
16 years 28 days ago
2003
IEEE
The Support Vector Machine (SVM) solution corresponds to the centre of the largest sphere inscribed in version space. Alternative approaches like Bayesian Point Machines (BPM) and...
167
click to vote
CSCLP
2003
Springer
16 years 26 days ago
2003
Springer
Abstract. In [8], Freuder defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently [2], we extended the definition of interchangeability to Soft ...
176
click to vote
ASPDAC
1999
ACM
15 years 12 months ago
1999
ACM
We present an algorithm for solving a general min-cut, twoway partitioning problem subject to timing constraints. The problem is formulated as a constrained programming problem an...
235
click to vote
COLT
1999
Springer
15 years 12 months ago
1999
Springer
We propose a new boosting algorithm. This boosting algorithm is an adaptive version of the boost by majority algorithm and combines bounded goals of the boost by majority algorith...