Sciweavers

1805 search results - page 74 / 361
» Functional programming with structured graphs
Sort
View
KDD
2006
ACM
157views Data Mining» more  KDD 2006»
14 years 11 months ago
Using structure indices for efficient approximation of network properties
Statistics on networks have become vital to the study of relational data drawn from areas such as bibliometrics, fraud detection, bioinformatics, and the Internet. Calculating man...
Matthew J. Rattigan, Marc Maier, David Jensen
EUROGP
2005
Springer
122views Optimization» more  EUROGP 2005»
14 years 4 months ago
Evolution of Robot Controller Using Cartesian Genetic Programming
Abstract. Cartesian Genetic Programming is a graph based representation that has many benefits over traditional tree based methods, including bloat free evolution and faster evolu...
Simon Harding, Julian F. Miller
ICML
2005
IEEE
14 years 11 months ago
Online learning over graphs
We apply classic online learning techniques similar to the perceptron algorithm to the problem of learning a function defined on a graph. The benefit of our approach includes simp...
Mark Herbster, Massimiliano Pontil, Lisa Wainer
CVPR
2011
IEEE
13 years 6 months ago
Submodularity beyond submodular energies: coupling edges in graph cuts
We propose a new family of non-submodular global energy functions that still use submodularity internally to couple edges in a graph cut. We show it is possible to develop an ef...
Stefanie Jegelka, Jeff Bilmes
ICFP
2007
ACM
14 years 10 months ago
Bidirectionalization transformation based on automatic derivation of view complement functions
Bidirectional transformation is a pair of transformations: a view function and a backward transformation. A view function maps one data structure called source onto another called...
Kazutaka Matsuda, Zhenjiang Hu, Keisuke Nakano, Ma...