Sciweavers

2310 search results - page 300 / 462
» The selection efficiency of tournaments
Sort
View
CORR
2010
Springer
117views Education» more  CORR 2010»
15 years 6 months ago
Evaluating and Improving Modern Variable and Revision Ordering Strategies in CSPs
A key factor that can dramatically reduce the search space during constraint solving is the criterion under which the variable to be instantiated next is selected. For this purpos...
Thanasis Balafoutis, Kostas Stergiou
CORR
2010
Springer
139views Education» more  CORR 2010»
15 years 6 months ago
Fast Overlapping Group Lasso
The group Lasso is an extension of the Lasso for feature selection on (predefined) non-overlapping groups of features. The non-overlapping group structure limits its applicability...
Jun Liu, Jieping Ye
NECO
2008
108views more  NECO 2008»
15 years 6 months ago
An SMO Algorithm for the Potential Support Vector Machine
We describe a fast Sequential Minimal Optimization (SMO) procedure for solving the dual optimization problem of the recently proposed Potential Support Vector Machine (P-SVM). The...
Tilman Knebel, Sepp Hochreiter, Klaus Obermayer
IJMI
2007
140views more  IJMI 2007»
15 years 6 months ago
Securing electronic health records without impeding the flow of information
Objective: We present an integrated set of technologies, known as the Hippocratic Database, that enable healthcare enterprises to comply with privacy and security laws without imp...
Rakesh Agrawal, Christopher M. Johnson
CG
2004
Springer
15 years 6 months ago
Dynamic surfel set refinement for high-quality rendering
Splatting-based rendering techniques are currently the best choice for efficient high-quality rendering of point-based geometries. However, such techniques are not suitable for la...
Gaël Guennebaud, Loïc Barthe, Mathias Pa...