Sciweavers

985 search results - page 106 / 197
» Piercing Convex Sets
Sort
View
ICMLA
2004
15 years 5 months ago
Two new regularized AdaBoost algorithms
AdaBoost rarely suffers from overfitting problems in low noise data cases. However, recent studies with highly noisy patterns clearly showed that overfitting can occur. A natural s...
Yijun Sun, Jian Li, William W. Hager
WSCG
2000
107views more  WSCG 2000»
15 years 5 months ago
Faster ASV Decomposition for Orthogonal Polyhedra, Using the Extreme Vertices Model (EVM)
The alternating sum of volumes (ASV) decomposition is a widely used technique for converting a b-rep into a CSG model, with all its implicit uses and advantages -like form feature...
Antonio Aguilera, Dolors Ayala
AUTOMATICA
2007
72views more  AUTOMATICA 2007»
15 years 4 months ago
A probabilistic analytic center cutting plane method for feasibility of uncertain LMIs
ust control problems can be formulated in abstract form as convex feasibility programs, where one seeks a solution x that satisfies a set of inequalities of the form F . = {f (x,...
Giuseppe C. Calafiore, Fabrizio Dabbene
IOR
2008
85views more  IOR 2008»
15 years 4 months ago
Equity-Efficiency Bicriteria Location with Squared Euclidean Distances
A facility has to be located within a given region taking two criteria of equity and efficiency into account. Equity is sought by minimizing the inequality in the inhabitant-facil...
Yoshiaki Ohsawa, Naoya Ozaki, Frank Plastria
JMLR
2006
116views more  JMLR 2006»
15 years 4 months ago
Point-Based Value Iteration for Continuous POMDPs
We propose a novel approach to optimize Partially Observable Markov Decisions Processes (POMDPs) defined on continuous spaces. To date, most algorithms for model-based POMDPs are ...
Josep M. Porta, Nikos A. Vlassis, Matthijs T. J. S...