Sciweavers

CSDA
2007
127views more  CSDA 2007»
13 years 9 months ago
Computing the least quartile difference estimator in the plane
A common problem in linear regression is that largely aberrant values can strongly influence the results. The least quartile difference (LQD) regression estimator is highly robus...
Thorsten Bernholt, Robin Nunkesser, Karen Schettli...
JMLR
2008
79views more  JMLR 2008»
13 years 9 months ago
Manifold Learning: The Price of Normalization
We analyze the performance of a class of manifold-learning algorithms that find their output by minimizing a quadratic form under some normalization constraints. This class consis...
Yair Goldberg, Alon Zakai, Dan Kushnir, Yaacov Rit...
JMLR
2008
92views more  JMLR 2008»
13 years 9 months ago
Theoretical Advantages of Lenient Learners: An Evolutionary Game Theoretic Perspective
This paper presents the dynamics of multiple learning agents from an evolutionary game theoretic perspective. We provide replicator dynamics models for cooperative coevolutionary ...
Liviu Panait, Karl Tuyls, Sean Luke
JMLR
2008
230views more  JMLR 2008»
13 years 9 months ago
Exponentiated Gradient Algorithms for Conditional Random Fields and Max-Margin Markov Networks
Log-linear and maximum-margin models are two commonly-used methods in supervised machine learning, and are frequently used in structured prediction problems. Efficient learning of...
Michael Collins, Amir Globerson, Terry Koo, Xavier...
JMIV
2008
214views more  JMIV 2008»
13 years 9 months ago
A Network Flow Algorithm for Reconstructing Binary Images from Continuous X-rays
Tomography is a powerful technique to obtain accurate images of the interior of an object in a nondestructive way. Conventional reconstruction algorithms, such as filtered backproj...
Kees Joost Batenburg
CPHYSICS
2007
79views more  CPHYSICS 2007»
13 years 9 months ago
Multimillion atom simulations of dynamics of wing cracks and nanoscale damage in glass, and hypervelocity impact damage in ceram
We have developed scalable parallel algorithms for first-principles based predictive atomistic simulations of materials.
Priya Vashishta, Rajiv K. Kalia, Aiichiro Nakano
CPC
2007
61views more  CPC 2007»
13 years 9 months ago
Maximizing Several Cuts Simultaneously
Consider two graphs G1 and G2 on the same vertex set V and suppose that Gi has mi edges. Then there is a bipartition of V into two classes A and B so that for both i = 1, 2 we hav...
Daniela Kühn, Deryk Osthus
ISCI
2006
167views more  ISCI 2006»
13 years 9 months ago
Efficient unbalanced merge-sort
Sorting algorithms based on successive merging of ordered subsequences are widely used, due to their efficiency and to their intrinsically parallelizable structure. Among them, th...
Enrico Nardelli, Guido Proietti
JGO
2008
90views more  JGO 2008»
13 years 9 months ago
A scaling algorithm for polynomial constraint satisfaction problems
Abstract. Good scaling is an essential requirement for the good behavior of many numerical algorithms. In particular, for problems involving multivariate polynomials, a change of s...
Ferenc Domes, Arnold Neumaier
CORR
2007
Springer
144views Education» more  CORR 2007»
13 years 9 months ago
Optimization of Information Rate Upper and Lower Bounds for Channels with Memory
—We consider the problem of minimizing upper bounds and maximizing lower bounds on information rates of stationary and ergodic discrete-time channels with memory. The channels we...
Parastoo Sadeghi, Pascal O. Vontobel, Ramtin Shams