Sciweavers

2969 search results - page 269 / 594
» A space efficient algorithm for group structure computation
Sort
View
JMLR
2006
93views more  JMLR 2006»
15 years 4 months ago
An Efficient Implementation of an Active Set Method for SVMs
We propose an active set algorithm to solve the convex quadratic programming (QP) problem which is the core of the support vector machine (SVM) training. The underlying method is ...
Katya Scheinberg
LION
2009
Springer
145views Optimization» more  LION 2009»
15 years 11 months ago
A Variable Neighborhood Descent Search Algorithm for Delay-Constrained Least-Cost Multicast Routing
Abstract. The rapid evolution of real-time multimedia applications requires Quality of Service (QoS) based multicast routing in underlying computer networks. The constrained Steine...
Rong Qu, Ying Xu, Graham Kendall
VMV
2007
141views Visualization» more  VMV 2007»
15 years 5 months ago
Distance Calculation between a Point and a Subdivision Surface
This article focuses on algorithms for fast computation of the Euclidean distance between a query point and a subdivision surface. The analyzed algorithms include uniform tessella...
Torsten Ullrich, Volker Settgast, Ulrich Krispel, ...
CAGD
2004
87views more  CAGD 2004»
15 years 4 months ago
Gliding spline motions and applications
We consider the ICP (iterative closest point) algorithm, which may in general be used for moving `active' elements such as curves and surfaces towards geometric objects whose...
Johannes Wallner
ATAL
2006
Springer
15 years 8 months ago
No-commitment branch and bound search for distributed constraint optimization
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
Anton Chechetka, Katia P. Sycara