Sciweavers

3353 search results - page 420 / 671
» Laver and set theory
Sort
View
COCO
2004
Springer
119views Algorithms» more  COCO 2004»
15 years 10 months ago
Tight Lower Bounds for Certain Parameterized NP-Hard Problems
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Hua...
DICTA
2003
15 years 8 months ago
Algebraic Curve Fitting Support Vector Machines
An algebraic curve is defined as the zero set of a multivariate polynomial. We consider the problem of fitting an algebraic curve to a set of vectors given an additional set of v...
Christian J. Walder, Brian C. Lovell, Peter J. Koo...
179
Voted
NIPS
1998
15 years 8 months ago
Semi-Supervised Support Vector Machines
We introduce a semi-supervised support vector machine (S3 VM) method. Given a training set of labeled data and a working set of unlabeled data, S3 VM constructs a support vector m...
Kristin P. Bennett, Ayhan Demiriz
JAR
2006
236views more  JAR 2006»
15 years 6 months ago
Deciding Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard
CVPR
1999
IEEE
1104views Computer Vision» more  CVPR 1999»
16 years 8 months ago
Geodesic Active Contours for Supervised Texture Segmentation
This paper presents a variational method for supervised texture segmentation, which is based on ideas coming from the curve propagation theory. We assume that a preferable texture...
Nikos Paragios, Rachid Deriche