Sciweavers

999 search results - page 182 / 200
» Finding shapes in a set of points
Sort
View
TNN
2010
154views Management» more  TNN 2010»
13 years 3 months ago
Discriminative semi-supervised feature selection via manifold regularization
We consider the problem of semi-supervised feature selection, where we are given a small amount of labeled examples and a large amount of unlabeled examples. Since a small number ...
Zenglin Xu, Irwin King, Michael R. Lyu, Rong Jin
PG
2007
IEEE
14 years 2 months ago
Fast and Faithful Geometric Algorithm for Detecting Crest Lines on Meshes
A new geometry-based finite difference method for a fast and reliable detection of perceptually salient curvature extrema on surfaces approximated by dense triangle meshes is pro...
Shin Yoshizawa, Alexander G. Belyaev, Hideo Yokota...
ESA
2007
Springer
176views Algorithms» more  ESA 2007»
14 years 2 months ago
Arrangements in Geometry: Recent Advances and Challenges
We review recent progress in the study of arrangements in computational and combinatorial geometry, and discuss several open problems and areas for further research. In this talk I...
Micha Sharir
IUI
2004
ACM
14 years 1 months ago
Robust sketched symbol fragmentation using templates
Analysis of sketched digital ink is often aided by the division of stroke points into perceptually-salient fragments based on geometric features. Fragmentation has many applicatio...
Heloise Hwawen Hse, Michael Shilman, A. Richard Ne...
COLT
1999
Springer
14 years 24 days ago
Regret Bounds for Prediction Problems
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
Geoffrey J. Gordon