Sciweavers

1387 search results - page 65 / 278
» Convexity in Discrete Space
Sort
View
127
Voted
JMLR
2008
169views more  JMLR 2008»
15 years 18 days ago
Multi-class Discriminant Kernel Learning via Convex Programming
Regularized kernel discriminant analysis (RKDA) performs linear discriminant analysis in the feature space via the kernel trick. Its performance depends on the selection of kernel...
Jieping Ye, Shuiwang Ji, Jianhui Chen
IJCGA
1998
74views more  IJCGA 1998»
15 years 9 days ago
Polyhedral Assembly Partitioning Using Maximally Covered Cells in Arrangements of Convex Polytopes
We study the following problem: Given a collection A of polyhedral parts in 3D, determine whether there exists a subset S of the parts that can be moved as a rigid body by in nite...
Leonidas J. Guibas, Dan Halperin, Hirohisa Hirukaw...
MP
2002
195views more  MP 2002»
15 years 9 days ago
Nonlinear rescaling vs. smoothing technique in convex optimization
We introduce an alternative to the smoothing technique approach for constrained optimization. As it turns out for any given smoothing function there exists a modification with part...
Roman A. Polyak
76
Voted
SIAMCOMP
1998
86views more  SIAMCOMP 1998»
15 years 8 days ago
Exact Learning of Discretized Geometric Concepts
We first present an algorithm that uses membership and equivalence queries to exactly identify a discretized geometric concept defined by the union of m axis-parallel boxes in d-...
Nader H. Bshouty, Paul W. Goldberg, Sally A. Goldm...
58
Voted
ICPR
2008
IEEE
15 years 7 months ago
Linear representation of discrete surfaces in 3D
A method to compute a linear medial representation of a complex surface in the 3D discrete space is presented. The method involves voxel classification, surface labeling, anchor p...
Carlo Arcelli, Gabriella Sanniti di Baja, Luca Ser...