Sciweavers

1170 search results - page 75 / 234
» How Fast Is Too Fast
Sort
View
NECO
2000
113views more  NECO 2000»
15 years 2 months ago
Geometric Analysis of Population Rhythms in Synaptically Coupled Neuronal Networks
We develop geometric dynamical systems methods to determine how various components contribute to a neuronal network's emergent population behavior. The results clarify the mu...
Jonathan E. Rubin, David Terman
ESA
1998
Springer
162views Algorithms» more  ESA 1998»
15 years 6 months ago
External Memory Algorithms
Abstract. Data sets in large applications are often too massive to t completely inside the computer's internal memory. The resulting input output communication or I O between ...
Jeffrey Scott Vitter
REPLICATION
2010
15 years 1 months ago
A History of the Virtual Synchrony Replication Model
In this chapter, we discuss a widely used fault-tolerant data replication model called virtual synchrony. The model responds to two kinds of needs. First, there is the practical qu...
Ken Birman
ICCAD
2007
IEEE
281views Hardware» more  ICCAD 2007»
15 years 12 months ago
Archer: a history-driven global routing algorithm
Global routing is an important step in the physical design process. In this paper, we propose a new global routing algorithm Archer, which resolves some of the most common problem...
Muhammet Mustafa Ozdal, Martin D. F. Wong
WAPCV
2004
Springer
15 years 8 months ago
Towards a Biologically Plausible Active Visual Search Model
Abstract. This paper proposes a neuronal-based solution to active visual search, that is, visual search for a given target in displays that are too large in spatial extent to be in...
Andrei Zaharescu, Albert L. Rothenstein, John K. T...