نتایج جستجو برای: machine number

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

Journal: :Computers & Education 2002
Gill Kirkup

Online learning now seems to be ‘all the rage’! There has therefore been a substantial increase in research publications and books dealing with this very exciting and challenging topic. Some years ago, Gilly Salmon (2000) produced an interesting and valuable book on ‘e-moderating’ in online learning environments primarily, those that use computer conferencing as a major teaching and learning me...

2007
Lihong Zheng Xiangjian He Qiang Wu Tom Hintz

In real time number plate recognition, some vehicle number plates can not be recognized due to very poor illumination, motion blurred effect, fade characters and so on. The key problem is that number plate can not be segmented accurately and correctly. In this paper, we present a recognition method based on Support Vector Machines (SVMs). Firstly, some concepts of SVMs are briefly reviewed. The...

Journal: :Computación y Sistemas 2015
Belém Priego Sánchez David Pinto

Verbal Phraseological Units are phrases made up of two or more words in which at least one of the words is a verb that plays the role of the predicate. One of the characteristics of this type of expression is that its global meaning rarely can be deduced from the meaning of its components. The automatic recognition of this type of linguistic structures is a very important task, since they are a...

2006
M Kreps

In 2003 the X(3872) particle was discovered by the Belle collaboration. Despite results collected since then, the nature of the state still remains unclear. In this contribution we report on new results on properties of the X(3872) state using data collected with CDF II detector at the Fermilab Tevatron. The dipion mass spectrum and angular distributions are used to determine the J P C quantum ...

2007
Siling Wang Yuhang Wang Luc Girard Young Kim Jonathan R. Pollack John D. Minna

Cancer classification using DNA copy number data is an important bioinformatics problem. Effective machine learning models for this task can be useful not only for cancer diagnosis, but also for discovering novel tumor suppressor genes and oncogenes. The recent array-based assays that detect DNA copy numbers contain very large numbers of probes and thus generate data of extremely high dimension...

Journal: :IEICE Transactions 2011
Kazuya Ueki Masashi Sugiyama Yasuyuki Ihara

Over the recent years, a great deal of effort has been made to age estimation from face images. It has been reported that age can be accurately estimated under controlled environment such as frontal faces, no expression, and static lighting conditions. However, it is not straightforward to achieve the same accuracy level in real-world environment because of considerable variations in camera set...

Journal: :CoRR 2010
Nicolas Brener

The Turing machine (TM) and the Church thesis have formalized the concept of computable number, this allowed to display noncomputable numbers. This paper defines the concept of number “approachable” by a TM and shows that some (if not all) known non-computable numbers are approachable by TMs. Then an example of a number not approachable by a TM is given.

Journal: :iJET 2012
Olubunmi P. Aborisade

Telephone technology is a technology that stands the test of time. Since it was invented in 1876 by Alexander Graham Belle, it has remained the technology of all time. This article reports the major findings of a recent research, ‘How Technology Transforms Citizen Journalism Business in Nigeria’. According to the research, Telephone technology has over the years emerged a major tool with which ...

2015
Alekh Agarwal Léon Bottou

This paper presents a lower bound for optimizing a finite sum of n functions, where each function is L-smooth and the sum is μ-strongly convex. We show that no algorithm can reach an error ε in minimizing all functions from this class in fewer than Ω(n+ √ n(κ−1) log(1/ε)) iterations, where κ = L/μ is a surrogate condition number. We then compare this lower bound to upper bounds for recently dev...

2005
André Kempe Jean-Marc Champarnaud Jason Eisner Franck Guingne Florent Nicart

Weighted finite-state machines with n tapes describe n-ary rational string relations. The join n-ary relation is very important regarding to applications. It is shown how to compute it via a more simple operation, the auto-intersection. Join and auto-intersection generally do not preserve rationality. We define a class of triples 〈A, i, j〉 such that the auto-intersection of the machine A w.r.t....

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

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