Sciweavers

3656 search results - page 239 / 732
» Compact Location Problems
Sort
View
CPM
2006
Springer
143views Combinatorics» more  CPM 2006»
15 years 10 months ago
Algorithms for Finding a Most Similar Subforest
Given an ordered labeled forest F ("the target forest") and an ordered labeled forest G ("the pattern forest"), the most similar subforest problem is to find a ...
Jesper Jansson, Zeshan Peng
HIS
2008
15 years 7 months ago
Neural Plasticity and Minimal Topologies for Reward-Based Learning
Artificial Neural Networks for online learning problems are often implemented with synaptic plasticity to achieve adaptive behaviour. A common problem is that the overall learning...
Andrea Soltoggio
NIPS
2004
15 years 7 months ago
Seeing through water
We consider the problem of recovering an underwater image distorted by surface waves. A large amount of video data of the distorted image is acquired. The problem is posed in term...
Alexei A. Efros, Volkan Isler, Jianbo Shi, Mirk&oa...
CORR
2011
Springer
179views Education» more  CORR 2011»
15 years 1 months ago
Cooperative searching for stochastic targets
Spatial search problems abound in the real world, from locating hidden nuclear or chemical sources to finding skiers after an avalanche. We exemplify the formalism and solution fo...
Vadas Gintautas, Aric A. Hagberg, Luís M. A...
CORR
2011
Springer
147views Education» more  CORR 2011»
15 years 1 months ago
On Reachability for Hybrid Automata over Bounded Time
This paper investigates the time-bounded version of the reachability problem for hybrid automata. This problem asks whether a given hybrid automaton can reach a given target locat...
Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, J...