نتایج جستجو برای: suited hence

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

Journal: :Expert Syst. Appl. 2011
Carles Fernández Pau Baiget F. Xavier Roca Jordi Gonzàlez

State-of-the-art systems on cognitive surveillance identify and describe complex events in selected domains, thus providing end-users with tools to easily access the contents of massive video footage. Nevertheless, as the complexity of events increases in semantics and the types of indoor/outdoor scenarios diversify, it becomes difficult to assess which events describe better the scene, and how...

2006
Juan A. Acebrón Raúl Durán Rafael Rico Renato Spigler

In this paper, we describe a new kind of domain decomposition strategy for solving linear elliptic boundary-value problems. It outperforms the traditional ones in complex and heterogeneous networks like those for grid computing. Such a strategy consists of a hybrid numerical scheme based on a probabilistic method along with a domain decomposition, and full decoupling can be accomplished. While ...

Journal: :J. of IT & Tourism 2014
Marius Kaminskas Ignacio Fernández-Tobías Francesco Ricci Iván Cantador

Place is a notion closely linked with the wealth of human experience, and invested by values, attitudes, and cultural influences. In particular, many places are strongly related to music, which contributes to shaping the perception and meaning of a place. In this paper we propose a computational approach to identify musicians and music suited for a place of interest (POI)––which is based on a k...

2015
Julio Santisteban Ximena Aranzaens Cam

— Today almost every one use a taxi, in many countries the rate is agreed upon the service is taken, in many cases the rate is too low or high and the service is not taken, on the other hand taximeters provides good estimated of the service but are too complex to install in a cab and maintain. Today we can get advance of GPS technology to improve and enhance the taximeters while the rate is cal...

Journal: :Math. Program. 2009
Krzysztof C. Kiwiel Claude Lemaréchal

We give a bundle method for constrained convex optimization. Instead of using penalty functions, it shifts iterates towards feasibility, by way of a Slater point, assumed to be known. Besides, the method accepts an oracle delivering function and subgradient values with unknown accuracy. Our approach is motivated by a number of applications in column generation, in which constraints are positive...

Journal: :Journal of Computational and Applied Mathematics 2007

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

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