MCS
2011
Springer
12 years 11 months ago
2011
Springer
Consider a matrix valued function A(x) ∈ Rm×n , m ≥ n, smoothly depending on parameters x ∈ Ω ⊂ R2 , where Ω is simply connected and bounded. We consider a technique t...
JMLR
2011
12 years 11 months ago
2011
Reports of experiments conducted with an Inductive Logic Programming system rarely describe how specific values of parameters of the system are arrived at when constructing model...
CEC
2010
IEEE
12 years 11 months ago
2010
IEEE
High-throughput analytical techniques such as nuclear magnetic resonance, protein kinase phosphorylation, and mass spectroscopic methods generate time dense profiles of metabolites...
CDC
2010
IEEE
12 years 11 months ago
2010
IEEE
In this paper, we present a model of distributed parameter estimation in networks, where agents have access to partially informative measurements over time. Each agent faces a loca...
CDC
2010
IEEE
12 years 11 months ago
2010
IEEE
Abstract-- We present a new algorithm for solving a polynomial program P based on the recent "joint + marginal" approach of the first author for parametric polynomial opt...
CVPR
2011
IEEE
13 years 1 months ago
2011
IEEE
Many successful models for predicting attention in a scene involve three main steps: convolution with a set of filters, a center-surround mechanism and spatial pooling to constru...
IJON
2010
13 years 1 months ago
2010
Graph construction plays a key role on learning algorithms based on graph Laplacian. However, the traditional graph construction approaches of -neighborhood and k-nearest-neighbor...
ICDM
2010
IEEE
13 years 1 months ago
2010
IEEE
Community detection is an important task for mining the structure and function of complex networks. Many pervious approaches are difficult to detect communities with arbitrary size...
ICONIP
2009
13 years 2 months ago
2009
Trust dynamics can be modelled in relation to experiences. Both cognitive and neural models for trust dynamics in relation to experiences are available, but were not yet related or...
ICDM
2009
IEEE
13 years 2 months ago
2009
IEEE
Clustering methods usually require to know the best number of clusters, or another parameter, e.g. a threshold, which is not ever easy to provide. This paper proposes a new graph-b...