Sciweavers

3047 search results - page 156 / 610
» Randomized Parallel Selection
Sort
View
GLOBECOM
2007
IEEE
15 years 5 months ago
Parallel Search Trie-Based Scheme for Fast IP Lookup
—As data rates in the Internet increase, the Internet Protocol (IP) address lookup is required to be resolved in shorter resolution times. IP address lookup involves finding the...
Roberto Rojas-Cessa, Lakshmi Ramesh, Ziqian Dong, ...
CIKM
2004
Springer
15 years 4 months ago
Approximating the top-m passages in a parallel question answering system
We examine the problem of retrieving the top-m ranked items from a large collection, randomly distributed across an n-node system. In order to retrieve the top m overall, we must ...
Charles L. A. Clarke, Egidio L. Terra
EGPGV
2004
Springer
165views Visualization» more  EGPGV 2004»
15 years 4 months ago
Tuning of Algorithms for Independent Task Placement in the Context of Demand-Driven Parallel Ray Tracing
This paper investigates assignment strategies (load balancing algorithms) for process farms which solve the problem of online placement of a constant number of independent tasks w...
Tomas Plachetka
CLUSTER
2008
IEEE
15 years 5 months ago
SPRAT: Runtime processor selection for energy-aware computing
—A commodity personal computer (PC) can be seen as a hybrid computing system equipped with two different kinds of processors, i.e. CPU and a graphics processing unit (GPU). Since...
Hiroyuki Takizawa, Katsuto Sato, Hiroaki Kobayashi
IJON
2006
73views more  IJON 2006»
14 years 11 months ago
Selective attention implemented with dynamic synapses and integrate-and-fire neurons
Selective attention is a process widely used by biological sensory systems to overcome the problem of limited parallel processing capacity: salient subregions of the input stimuli...
Chiara Bartolozzi, Giacomo Indiveri