Sciweavers

1734 search results - page 276 / 347
» its 2000
Sort
View
JMLR
2006
150views more  JMLR 2006»
13 years 10 months ago
Exact 1-Norm Support Vector Machines Via Unconstrained Convex Differentiable Minimization
Support vector machines utilizing the 1-norm, typically set up as linear programs (Mangasarian, 2000; Bradley and Mangasarian, 1998), are formulated here as a completely unconstra...
Olvi L. Mangasarian
JMLR
2006
124views more  JMLR 2006»
13 years 10 months ago
Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problem
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
Tijl De Bie, Nello Cristianini
TCAD
2008
88views more  TCAD 2008»
13 years 10 months ago
Self-Adaptive Data Caches for Soft-Error Reliability
Soft-error induced reliability problems have become a major challenge in designing new generation microprocessors. Due to the on-chip caches' dominant share in die area and tr...
Shuai Wang, Jie S. Hu, Sotirios G. Ziavras
MCS
2007
Springer
13 years 9 months ago
A domain decomposition solver for ferromagnetism
We model ferromagnetic effects by using reduced scalar potential. An overlapping domain-decomposition technique is proposed to solve the underlying problem in unbounded domain. I...
Ales Janka
AAMAS
2000
Springer
13 years 9 months ago
Rational Coordination in Multi-Agent Environments
We adopt the decision-theoretic principle of expected utility maximization as a paradigm for designing autonomous rational agents, and present a framework that uses this paradigm t...
Piotr J. Gmytrasiewicz, Edmund H. Durfee