Sciweavers

313 search results - page 13 / 63
» Complete Local Search with Memory
Sort
View
SIGMETRICS
2010
ACM
201views Hardware» more  SIGMETRICS 2010»
14 years 2 months ago
Load balancing via random local search in closed and open systems
In this paper, we analyze the performance of random load resampling and migration strategies in parallel server systems. Clients initially attach to an arbitrary server, but may s...
Ayalvadi Ganesh, Sarah Lilienthal, D. Manjunath, A...
PAMI
2012
12 years 7 days ago
Aggregating Local Image Descriptors into Compact Codes
— This paper addresses the problem of large-scale image search. Three constraints have to be taken into account: search accuracy, efficiency, and memory usage. We first present...
Hervé Jégou, Florent Perronnin, Matt...
CONNECTION
2006
101views more  CONNECTION 2006»
13 years 9 months ago
High capacity, small world associative memory models
Models of associative memory usually have full connectivity or if diluted, random symmetric connectivity. In contrast, biological neural systems have predominantly local, non-symm...
Neil Davey, Lee Calcraft, Rod Adams
GLVLSI
2007
IEEE
154views VLSI» more  GLVLSI 2007»
14 years 4 months ago
A design kit for a fully working shared memory multiprocessor on FPGA
This paper presents a framework to design a shared memory multiprocessor on a programmable platform. We propose a complete flow, composed by a programming model and a template ar...
Antonino Tumeo, Matteo Monchiero, Gianluca Palermo...
ISCI
2000
80views more  ISCI 2000»
13 years 9 months ago
Quantum associative memory with distributed queries
This paper discusses a model of quantum associative memory which generalizes the completing associative memory proposed by Ventura and Martinez. Similar to this model, our system ...
A. A. Ezhov, A. V. Nifanova, Dan Ventura