نتایج جستجو برای: many scientific

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

2009
Sittichai Jiampojamarn Aditya Bhargava Qing Dou Kenneth Dwyer Grzegorz Kondrak

We present DIRECTL: an online discriminative sequence prediction model that employs a many-to-many alignment between target and source. Our system incorporates input segmentation, target character prediction, and sequence modeling in a unified dynamic programming framework. Experimental results suggest that DIRECTL is able to independently discover many of the language-specific regularities in ...

Journal: :CoRR 2013
Fatemeh Rajabi-Alni Alireza Bagheri

Let A and B be two finite sets of points with total cardinality n, the many to many point matching with demands and capacities matches each point ai ∈ A to at least αi and at most α ′ i points in B, and each point bj ∈ B to at least βj and at most β ′ j points in A for all 1 ≤ i ≤ s and 1 ≤ j ≤ t. In this paper, we present an upper bound for this problem using our new polynomial time algorithm.

2014
M. Fatih Demirci Ali Shokoufandeh Sven J. Dickinson

Postcode 06560 City Sogutozu State Ankara Country Turkey Author Degree Dr.

2000
H. D. Zeh

This is the retyped and slightly reformulated version of a paper that was circulated and semi-officially published already in 1981 in the Epistemological Letters of the Ferdinand-Gonseth Association in Biel (Switzerland) as Letter No 63.0. (Therefore, terms such as " new " or " recent " refer to that year.) This paper offered a " discussion of the epistemological implications of quantum theory ...

2011
Jeffrey A. Barrett Bryce DeWitt J. A. Barrett Hugh Everett

Everett (1957a, b, 1973) relative-state formulation of quantum mechanics has often been taken to involve a metaphysical commitment to the existence of many splitting worlds each containing physical copies of observers and the objects they observe. While there was earlier talk of splitting worlds in connection with Everett, this is largely due to DeWitt’s (Phys Today 23:30–35, 1970) popular pres...

2015
Edbert J. Sie Alex J. Frenzel Yi-Hsien Lee Jing Kong Nuh Gedik

Edbert J. Sie,1 Alex J. Frenzel,1,2 Yi-Hsien Lee,3 Jing Kong,4 and Nuh Gedik1,* 1Department of Physics, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139, USA 2Department of Physics, Harvard University, Cambridge, Massachusetts 02138, USA 3Materials Science and Engineering, National Tsing-Hua University, Hsinchu 30013, Taiwan 4Department of Electrical Engineering and Compute...

2007
Constantino Tsallis Andrea Rapisarda Alessandro Pluchino Ernesto P. Borges

We discuss the non-Boltzmannian nature of quasi-stationary states in the Hamiltonian Mean Field (HMF) model, a paradigmatic model for long-range interacting classical many-body systems. We present a theorem excluding the Boltzmann-Gibbs exponential weight in Gibbs Γ-space of microscopic configurations, and comment a paper recently published by Baldovin and Orlandini (2006). On the basis of the ...

2011
Minchul Lee Rosa López Mahn-Soo Choi Thibaut Jonckheere Thierry Martin

Minchul Lee,1 Rosa López,2,3 Mahn-Soo Choi,4 Thibaut Jonckheere,5 and Thierry Martin5,6 1Department of Applied Physics, College of Applied Science, Kyung Hee University, Yongin 446-701, Korea 2Departament de Fı́sica, Universitat de les Illes Balears, E-07122 Palma de Mallorca, Spain 3Institut de Fı́sica Interdisciplinar i de Sistemes Complexos IFISC (CSIC-UIB), E-07122 Palma de Mallorca, Spain 4D...

Journal: :Int. J. Comput. Math. 2012
Jae-Ha Lee Jung-Heum Park

A k-disjoint path cover of a graph is a set of k internally vertex-disjoint paths which cover the vertex set with k paths and each of which runs between a source and a sink. Given that each source and sink v is associated with an integer-valued demand d(v) ≥ 1, we are concerned with general-demand k-disjoint path cover in which every source and sink v is contained in the d(v) paths. In this pap...

Journal: :Discrete Applied Mathematics 2015
Jung-Heum Park Insung Ihm

A many-to-many k-disjoint path cover of a graph joining two disjoint vertex sets S and T of equal size k is a set of k vertex-disjoint paths between S and T that altogether cover every vertex of the graph. The many-to-many k-disjoint path cover is classified as paired if each source in S is further required to be paired with a specific sink in T , or unpaired otherwise. In this paper, we first ...

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

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