نتایج جستجو برای: optimize place finding

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

2010
Claudia Radel Birgit Schmook Rinku Roy Chowdhury

Land change science has demonstrated that rural livelihoods around the world both drive and reflect changing environmental regimes and political economic/ structural transformations. This article explores the relationship between increasingly globalized rural livelihoods and in-place land change, assessing results from social surveys of smallholding households in the southern Yucatán region. We...

Journal: :Proceedings of the National Academy of Sciences of the United States of America 1998
A A Fenton R U Muller

The idea that the rat hippocampus stores a map of space is based on the existence of "place cells" that show "location-specific" firing. The discharge of place cells is confined with remarkable precision to a cell-specific part of the environment called the cell's "firing field." We demonstrate here that firing is not nearly as reliable in the time domain as in the positional domain. Discharge ...

2015
Kevin A. Mears Devin Harris William M. Bulleit

................................................................................................................. XII

Journal: :Hippocampus 1999
R U Muller B Poucet A A Fenton A Cressant

The spatial mapping theory of hippocampal function proposes that the rat hippocampus is specialized for navigational computations, computations that allow the animal to solve difficult spatial problems. In this paper, we review evidence obtained by recording place cells and other "spatially tuned" cells from freely moving rats. Our main conclusion is that the nature of the signals carried by th...

Journal: :Journal of experimental psychology. Learning, memory, and cognition 2014
Xue Han Suzanna Becker

We investigated how humans encode large-scale spatial environments using a virtual taxi game. We hypothesized that if 2 connected neighborhoods are explored jointly, people will form a single integrated spatial representation of the town. However, if the neighborhoods are first learned separately and later observed to be connected, people will form separate spatial representations; this should ...

Journal: :Brain research 2015
Marc W Howard Howard Eichenbaum

It has been hypothesized that one of the functions of the hippocampus is to enable the learning of relationships between different stimuli experienced in the environment. These relationships might be spatial ("the bathroom is about 5m down the hall from the bedroom") or temporal ("the coffee is ready about 3 min after the button was pressed"). Critically, these spatial and temporal relationship...

Journal: :Hippocampus 2000
T Hartley N Burgess C Lever F Cacucci J O'Keefe

A model of place-cell firing is presented that makes quantitative predictions about specific place cells' spatial receptive fields following changes to the rat's environment. A place cell's firing rate is modeled as a function of the rat's location by the thresholded sum of the firing rates of a number of putative cortical inputs. These inputs are tuned to respond whenever an environmental boun...

Journal: :J. Complexity 2009
A. A. Tretyakov Eugene E. Tyrtyshnikov

Given a rectangular m × n matrix stored as a two-dimensional array, we want to transpose it in place andmeasure the cost by the number of memory writes and the number of auxiliary cells used. We propose a transposition algorithm with optimal complexity O(mn) using only min(m, n) auxiliary memory cells. © 2009 Elsevier Inc. All rights reserved.

2011
Minati De Subhas C. Nandy

In this paper, we consider the problem of designing in-place algorithms for computing the maximum area empty rectangle of arbitrary orientation among a set of points in 2D, and the maximum volume empty axisparallel cuboid among a set of points in 3D. If n points are given in an array of size n, the worst case time complexity of our proposed algorithms for both the problems is O(n); both the alg...

2002
Hervé Brönnimann John Iacono Jyrki Katajainen Pat Morin Jason Morrison Godfried T. Toussaint

An in-place algorithm is one in which the output is given in the same location as the input and only a small amount of additional memory is used by the algorithm. In this paper we describe three in-place algorithms for computing the convex hull of a planar point set. All three algorithms are optimal, some more so than others. . .

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

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