Sciweavers

705 search results - page 104 / 141
» Approximating Extended Answer Sets
Sort
View
CSDA
2007
128views more  CSDA 2007»
14 years 9 months ago
Regularized linear and kernel redundancy analysis
Redundancy analysis (RA) is a versatile technique used to predict multivariate criterion variables from multivariate predictor variables. The reduced-rank feature of RA captures r...
Yoshio Takane, Heungsun Hwang
93
Voted
AAMAS
2011
Springer
14 years 4 months ago
Long-term fairness with bounded worst-case losses
How does one repeatedly choose actions so as to be fairest to the multiple beneficiaries of those actions? We examine approaches to discovering sequences of actions for which the...
Gabriel Catalin Balan, Dana Richards, Sean Luke
JMLR
2010
101views more  JMLR 2010»
14 years 4 months ago
Exploiting Feature Covariance in High-Dimensional Online Learning
Some online algorithms for linear classification model the uncertainty in their weights over the course of learning. Modeling the full covariance structure of the weights can prov...
Justin Ma, Alex Kulesza, Mark Dredze, Koby Crammer...
NETWORKS
2010
14 years 8 months ago
Probabilistic models for the Steiner Tree problem
We consider a probabilistic model for the Steiner Tree problem. Under this model the problem is defined in a 2-stage setting over a first-stage complete weighted graph having it...
Vangelis Th. Paschos, Orestis Telelis, Vassilis Zi...
BMCBI
2006
100views more  BMCBI 2006»
14 years 9 months ago
Towards a better solution to the shortest common supersequence problem: the deposition and reduction algorithm
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...
Kang Ning, Hon Wai Leong