Sciweavers

550 search results - page 41 / 110
» Optimization and Approximation Problems Related to Polynomia...
Sort
View
NIPS
2003
13 years 10 months ago
Convex Methods for Transduction
The 2-class transduction problem, as formulated by Vapnik [1], involves finding a separating hyperplane for a labelled data set that is also maximally distant from a given set of...
Tijl De Bie, Nello Cristianini
CASC
2007
Springer
108views Mathematics» more  CASC 2007»
14 years 3 months ago
Comprehensive Triangular Decomposition
We introduce the concept of comprehensive triangular decomposition (CTD) for a parametric polynomial system F with coefficients in a field. In broad words, this is a finite part...
Changbo Chen, Oleg Golubitsky, François Lem...
PG
2007
IEEE
14 years 3 months ago
Developable Strip Approximation of Parametric Surfaces with Global Error Bounds
Developable surfaces have many desired properties in manufacturing process. Since most existing CAD systems utilize parametric surfaces as the design primitive, there is a great d...
Yong-Jin Liu, Yu-Kun Lai, Shi-Min Hu
JAIR
2000
152views more  JAIR 2000»
13 years 8 months ago
Value-Function Approximations for Partially Observable Markov Decision Processes
Partially observable Markov decision processes (POMDPs) provide an elegant mathematical framework for modeling complex decision and planning problems in stochastic domains in whic...
Milos Hauskrecht
CVIU
2011
13 years 10 days ago
Graph-based quadratic optimization: A fast evolutionary approach
Quadratic optimization lies at the very heart of many structural pattern recognition and computer vision problems, such as graph matching, object recognition, image segmentation, ...
Samuel Rota Bulò, Marcello Pelillo, Immanue...