Sciweavers

12459 search results - page 52 / 2492
» cans 2006
Sort
View
ORL
2007
82views more  ORL 2007»
13 years 7 months ago
The path partition problem and related problems in bipartite graphs
We prove that it is NP-complete to decide whether a bipartite graph of maximum degree three on nk vertices can be partitioned into n paths of length k. Finally, we propose some ap...
Jérôme Monnot, Sophie Toulouse
PSYCHNOLOGY
2008
91views more  PSYCHNOLOGY 2008»
13 years 7 months ago
Presence and Relaxation: A Preliminary Controlled Study
Technologies such as Virtual Reality (VR) that induce presence in a virtual, but still external, perceived world, have great power to evoke emotional experiences that can lead to ...
Daniela Villani, Giuseppe Riva
JC
2010
95views more  JC 2010»
13 years 6 months ago
Stochastic perturbations and smooth condition numbers
In this paper we dene a new condition number adapted to directionally uniform perturbations in a general framework of maps between Riemannian manifolds. The denitions and theorem...
Diego Armentano
JCNS
2010
88views more  JCNS 2010»
13 years 6 months ago
LFP spectral peaks in V1 cortex: network resonance and cortico-cortical feedback
Abstract This paper is about how cortical recurrent interactions in primary visual cortex (V1) together with feedback from extrastriate cortex can account for spectral peaks in the...
Kukjin Kang, Michael Shelley, James Andrew Henrie,...
JCSS
2010
68views more  JCSS 2010»
13 years 6 months ago
Simplified proof of the blocking theorem for free-choice Petri nets
: Every cluster in a bounded and live free-choice system has a unique blocking marking. It can be reached by firing an occurrence sequence, which avoids any transition of the clust...
Joachim Wehler