Sciweavers

6719 search results - page 410 / 1344
» A Generalization of Automatic Sequences
Sort
View
ORL
1998
130views more  ORL 1998»
15 years 4 months ago
Accelerating convergence in the Fermat-Weber location problem
This paper presents a simple procedure for accelerating convergence in a generalized Fermat–Weber problem with lp distances. The main idea is to multiply the predetermined step ...
Jack Brimberg, Reuven Chen, Doron Chen
JMLR
2010
105views more  JMLR 2010»
14 years 11 months ago
Causal Discovery as a Game
This paper presents a game theoretic approach to causal discovery. The problem of causal discovery is framed as a game of the Scientist against Nature, in which Nature attempts to...
Frederick Eberhardt
SIAMJO
2010
112views more  SIAMJO 2010»
14 years 11 months ago
A Semidefinite Relaxation Scheme for Multivariate Quartic Polynomial Optimization with Quadratic Constraints
We present a general semidefinite relaxation scheme for general n-variate quartic polynomial optimization under homogeneous quadratic constraints. Unlike the existing sum-of-squar...
Zhi-Quan Luo, Shuzhong Zhang
ICPR
2006
IEEE
16 years 5 months ago
A Ground Truth Correspondence Measure for Benchmarking
Automatic localisation of correspondences for the construction of Statistical Shape Models from examples has been the focus of intense research during the last decade. Several alg...
Anders Ericsson, Johan Karlsson
SAICSIT
2009
ACM
15 years 11 months ago
A lightweight methodology to improve web accessibility
This paper introduces a methodology to improve the accessibility of websites with the use of free so-called automatic tools. The methodology has three iterative phases, namely ass...
Mardé Greeff, Paula Kotzé