نتایج جستجو برای: short

تعداد نتایج: 437582  

2013
Anna Gorbenko

In this paper, we consider the problem of the shortest common parameterized supersequence. In particular, we consider an explicit reduction from the problem to the satisfiability problem.

2010
Kensuke Okuda Takashi Hirota Kenji Sasaki Hiroyuki Ishida

In the title compound, C(11)H(9)ClN(2)O, the fused-ring system is essentially planar, with a maximum deviation of 0.0323 (16) Å. In the crystal, mol-ecules are connected by N-H⋯O hydrogen bonds forming a zigzag chain along the c axis. Mol-ecules are further stacked along the a axis through weak π-π inter-actions, the shortest distance between ring centroids being 3.6476 (8) Å.

2008
Uzy Hadad

We give bounds on the shortest identity in finite simple groups of Lie type.

2016
Hideyoshi Igata Takuya Sasaki Yuji Ikegaya

Animals navigate using cognitive maps. However, how they adaptively exploit these maps in changing environments is not fully understood. In this study, we investigated the problem-solving behaviors of mice in a complicated maze in which multiple routes with different intersections were available (Test 1). Although all mice eventually settled on the shortest route, mice that initially exhibited ...

Journal: :Proceedings of the National Academy of Sciences of the United States of America 2014
Joaquín Goñi Martijn P van den Heuvel Andrea Avena-Koenigsberger Nieves Velez de Mendizabal Richard F Betzel Alessandra Griffa Patric Hagmann Bernat Corominas-Murtra Jean-Philippe Thiran Olaf Sporns

The complex relationship between structural and functional connectivity, as measured by noninvasive imaging of the human brain, poses many unresolved challenges and open questions. Here, we apply analytic measures of network communication to the structural connectivity of the human brain and explore the capacity of these measures to predict resting-state functional connectivity across three ind...

2014
Ryan G. Coleman Kim A. Sharp Ryan Geoffrey Coleman

2014
Marius Zimand

Bauwens, Mahklin, Vereshchagin and Zimand [1] and Teutsch [5] have shown that given a string x it is possible to construct in polynomial time a list containg a short description of it. We simplify their technique and present a shorter proof of this result.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید