Sciweavers

3946 search results - page 606 / 790
» The computational complexity of choice sets
Sort
View
TNN
2008
97views more  TNN 2008»
15 years 6 months ago
Training Hard-Margin Support Vector Machines Using Greedy Stagewise Algorithm
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...
Liefeng Bo, Ling Wang, Licheng Jiao
CG
2005
Springer
15 years 6 months ago
Combining SP-Octrees and impostors for the visualisation of multiresolution models
Space-Partition Octree (SP-Octree) is a hierarchical representation scheme for solid modelling. It allows a multiresolution representation of polyhedral objects, and has been succ...
Francisco J. Melero, Pedro Cano, Juan Carlos Torre...
IVC
2000
179views more  IVC 2000»
15 years 6 months ago
A system to place observers on a polyhedral terrain in polynomial time
The Art Gallery Problem deals with determining the number of observers necessary to cover an art gallery room such that every point is seen by at least one observer. This problem ...
Maurício Marengoni, Bruce A. Draper, Allen ...
JAIR
2000
152views more  JAIR 2000»
15 years 6 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
TON
1998
145views more  TON 1998»
15 years 6 months ago
Adaptive wavelength routing in all-optical networks
Abstract—In this paper we consider routing and wavelength assignment in wavelength-routed all-optical networks with circuitswitching. The conventional approaches to address this ...
Ahmed Mokhtar, Murat Azizoglu