906 resultados para 2004-04-BS


Relevância:

80.00% 80.00%

Publicador:

Resumo:

Taylor, L. (2004). Client-ship and Citizenship in Latin America. Bulletin of Latin American Research. 23(2), pp.213-227. RAE2008

Relevância:

80.00% 80.00%

Publicador:

Resumo:

Brian Garrod and David A. Fennell (2004). An analysis of whalewatching codes of conduct. Annals of Tourism Research, 31(2), 334-352. RAE2008

Relevância:

80.00% 80.00%

Publicador:

Resumo:

John Warren and Chris Topping (2004). A trait specific model of competition in a spatially structured plant community. Ecological Modelling, 180 pp.477-485 RAE2008

Relevância:

80.00% 80.00%

Publicador:

Resumo:

Maria Roca, Caron James, Adriana Pruzinsk?, Stefan H?rtensteiner, Howard Thomas and Helen Ougham. Analysis of the chlorophyll catabolism pathway in leaves of an introgression senescence mutant of Lolium temulentum. Phytochemistry, 65 (9), 1231-1238. Sponsorship: BBSRC RAE2008

Relevância:

80.00% 80.00%

Publicador:

Resumo:

12 hojas : ilustraciones.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

This article explores the state of the art in theories of special divine action by means of a study of the Divine Action Project (DAP) co-sponsored by the Vatican Observatory and the Center for Theology and the Natural Sciences in Berkeley. The basic aim is to introduce the DAP and to summarize its results, especially as these were compiled in the final “capstone” meeting of the DAP, and drawing on the published output of the project where possible. The subsidiary aim is to evaluate criticisms of theories of special divine action developed within the DAP.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

BoostMap is a recently proposed method for efficient approximate nearest neighbor retrieval in arbitrary non-Euclidean spaces with computationally expensive and possibly non-metric distance measures. Database and query objects are embedded into a Euclidean space, in which similarities can be rapidly measured using a weighted Manhattan distance. The key idea is formulating embedding construction as a machine learning task, where AdaBoost is used to combine simple, 1D embeddings into a multidimensional embedding that preserves a large amount of the proximity structure of the original space. This paper demonstrates that, using the machine learning formulation of BoostMap, we can optimize embeddings for indexing and classification, in ways that are not possible with existing alternatives for constructive embeddings, and without additional costs in retrieval time. First, we show how to construct embeddings that are query-sensitive, in the sense that they yield a different distance measure for different queries, so as to improve nearest neighbor retrieval accuracy for each query. Second, we show how to optimize embeddings for nearest neighbor classification tasks, by tuning them to approximate a parameter space distance measure, instead of the original feature-based distance measure.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

In many multi-camera vision systems the effect of camera locations on the task-specific quality of service is ignored. Researchers in Computational Geometry have proposed elegant solutions for some sensor location problem classes. Unfortunately, these solutions utilize unrealistic assumptions about the cameras' capabilities that make these algorithms unsuitable for many real-world computer vision applications: unlimited field of view, infinite depth of field, and/or infinite servo precision and speed. In this paper, the general camera placement problem is first defined with assumptions that are more consistent with the capabilities of real-world cameras. The region to be observed by cameras may be volumetric, static or dynamic, and may include holes that are caused, for instance, by columns or furniture in a room that can occlude potential camera views. A subclass of this general problem can be formulated in terms of planar regions that are typical of building floorplans. Given a floorplan to be observed, the problem is then to efficiently compute a camera layout such that certain task-specific constraints are met. A solution to this problem is obtained via binary optimization over a discrete problem space. In experiments the performance of the resulting system is demonstrated with different real floorplans.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

This technical report presents a combined solution for two problems, one: tracking objects in 3D space and estimating their trajectories and second: computing the similarity between previously estimated trajectories and clustering them using the similarities that we just computed. For the first part, trajectories are estimated using an EKF formulation that will provide the 3D trajectory up to a constant. To improve accuracy, when occlusions appear, multiple hypotheses are followed. For the second problem we compute the distances between trajectories using a similarity based on LCSS formulation. Similarities are computed between projections of trajectories on coordinate axes. Finally we group trajectories together based on previously computed distances, using a clustering algorithm. To check the validity of our approach, several experiments using real data were performed.