Sciweavers

1539 search results - page 197 / 308
» Fast and Simple Methods For Computing Control Points
Sort
View
ECML
2005
Springer
14 years 2 months ago
Kernel Basis Pursuit
ABSTRACT. Estimating a non-uniformly sampled function from a set of learning points is a classical regression problem. Kernel methods have been widely used in this context, but eve...
Vincent Guigue, Alain Rakotomamonjy, Stépha...
CORR
2008
Springer
68views Education» more  CORR 2008»
13 years 9 months ago
Comparing human and automatic thesaurus mapping approaches in the agricultural domain
Knowledge organization systems (KOS), like thesauri and other controlled vocabularies, are used to provide subject access to information systems across the web. Due to the heterog...
Boris Lauser, Gudrun Johannsen, Caterina Caracciol...
ICRA
2007
IEEE
155views Robotics» more  ICRA 2007»
14 years 3 months ago
Swept Volume approximation of polygon soups
— We present a fast GPU-based algorithm to approximate the Swept Volume (SV) boundary of arbitrary polygon soup models. Despite the extensive research on calculating the volume s...
Jesse C. Himmelstein, Etienne Ferre, Jean-Paul Lau...
CVPR
2012
IEEE
11 years 11 months ago
Large scale metric learning from equivalence constraints
In this paper, we raise important issues on scalability and the required degree of supervision of existing Mahalanobis metric learning methods. Often rather tedious optimization p...
Martin Köstinger, Martin Hirzer, Paul Wohlhar...
ICCS
2009
Springer
14 years 3 months ago
Modular, Fine-Grained Adaptation of Parallel Programs
We present a modular approach to realizing fine-grained adaptation of program behavior in a parallel environment. Using a compositional framework based on function call intercepti...
Pilsung Kang 0002, Naresh K. C. Selvarasu, Naren R...