Sciweavers

5100 search results - page 399 / 1020
» The Linear Complexity of a Graph
Sort
View
IPMI
2009
Springer
16 years 5 days ago
Dense Registration with Deformation Priors
Abstract. In this paper we propose a novel approach to define task-driven regularization constraints in deformable image registration using learned deformation priors. Our method ...
Ben Glocker, Nikos Komodakis, Nassir Navab, Georgi...
HCW
1999
IEEE
15 years 12 months ago
Multiple Cost Optimization for Task Assignment in Heterogeneous Computing Systems Using Learning Automata
A framework for task assignment in heterogeneous computing systems is presented in this work. The framework is based on a learning automata model. The proposed model can be used f...
Raju D. Venkataramana, N. Ranganathan
GECCO
2010
Springer
218views Optimization» more  GECCO 2010»
15 years 11 months ago
Cartesian genetic programming
This paper presents a new form of Genetic Programming called Cartesian Genetic Programming in which a program is represented as an indexed graph. The graph is encoded in the form o...
Julian Francis Miller, Simon L. Harding
EACL
2006
ACL Anthology
15 years 9 months ago
Constraints on Non-Projective Dependency Parsing
We investigate a series of graph-theoretic constraints on non-projective dependency parsing and their effect on expressivity, i.e. whether they allow naturally occurring syntactic...
Joakim Nivre
IPL
2006
115views more  IPL 2006»
15 years 7 months ago
Approximate maximum weight branchings
We consider a special subgraph of a weighted directed graph: one comprising only the k heaviest edges incoming to each vertex. We show that the maximum weight branching in this su...
Amitabha Bagchi, Ankur Bhargava, Torsten Suel