Sciweavers

271 search results - page 39 / 55
» Graph limits and parameter testing
Sort
View
PLDI
2004
ACM
14 years 3 months ago
The set constraint/CFL reachability connection in practice
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
John Kodumal, Alexander Aiken
ECCV
2010
Springer
14 years 3 months ago
Enhancing Interactive Image Segmentation with Automatic Label Set Augmentation
Abstract. We address the problem of having insufficient labels in an interactive image segmentation framework, for which most current methods would fail without further user inter...
ICPP
1994
IEEE
14 years 1 months ago
A New Approach to Scheduling Parallel Programs Using Task Duplication
1 In this paper, we explore the problem of scheduling parallel programs using task duplication for messagepassing multicomputers. Task duplication means scheduling a parallel progr...
Ishfaq Ahmad, Yu-Kwong Kwok
AROBOTS
2008
177views more  AROBOTS 2008»
13 years 10 months ago
Controlling swimming and crawling in a fish robot using a central pattern generator
Online trajectory generation for robots with multiple degrees of freedom is still a difficult and unsolved problem, in particular for non-steady state locomotion, that is, when th...
Alessandro Crespi, Daisy Lachat, Ariane Pasquier, ...
NIPS
2000
13 years 11 months ago
The Use of MDL to Select among Computational Models of Cognition
How should we decide among competing explanations of a cognitive process given limited observations? The problem of model selection is at the heart of progress in cognitive scienc...
In Jae Myung, Mark A. Pitt, Shaobo Zhang, Vijay Ba...