Sciweavers

7930 search results - page 593 / 1586
» Greedy in Approximation Algorithms
Sort
View
ICPR
2004
IEEE
16 years 8 months ago
Efficient Model Selection for Kernel Logistic Regression
Kernel logistic regression models, like their linear counterparts, can be trained using the efficient iteratively reweighted least-squares (IRWLS) algorithm. This approach suggest...
Gavin C. Cawley, Nicola L. C. Talbot
COCO
2007
Springer
142views Algorithms» more  COCO 2007»
16 years 1 months ago
Quantum t-designs: t-wise Independence in the Quantum World
A t-design for quantum states is a finite set of quantum states with the property of simulating the Haar-measure on quantum states w.r.t. any test that uses at most t copies of a...
Andris Ambainis, Joseph Emerson
GD
2006
Springer
15 years 10 months ago
Eigensolver Methods for Progressive Multidimensional Scaling of Large Data
We present a novel sampling-based approximation technique for classical multidimensional scaling that yields an extremely fast layout algorithm suitable even for very large graphs....
Ulrik Brandes, Christian Pich
ESANN
2007
15 years 8 months ago
Model Selection for Kernel Probit Regression
Abstract. The convex optimisation problem involved in fitting a kernel probit regression (KPR) model can be solved efficiently via an iteratively re-weighted least-squares (IRWLS)...
Gavin C. Cawley
PODS
2009
ACM
119views Database» more  PODS 2009»
16 years 7 months ago
Exceeding expectations and clustering uncertain data
Database technology is playing an increasingly important role in understanding and solving large-scale and complex scientific and societal problems and phenomena, for instance, un...
Sudipto Guha, Kamesh Munagala