Sciweavers

2842 search results - page 556 / 569
» Expansion and Search in Networks
Sort
View
SIGMETRICS
2010
ACM
213views Hardware» more  SIGMETRICS 2010»
14 years 1 months ago
Small subset queries and bloom filters using ternary associative memories, with applications
Associative memories offer high levels of parallelism in matching a query against stored entries. We design and analyze an architecture which uses a single lookup into a Ternary C...
Ashish Goel, Pankaj Gupta
SIGMOD
2010
ACM
202views Database» more  SIGMOD 2010»
14 years 1 months ago
PAROS: pareto optimal route selection
Modern maps provide a variety of information about roads and their surrounding landscape allowing navigation systems to go beyond simple shortest path computation. In this demo, w...
Franz Graf, Hans-Peter Kriegel, Matthias Renz, Mat...
EDCC
2010
Springer
14 years 1 months ago
D2HT: The Best of Both Worlds, Integrating RPS and DHT
Distributed Hash Tables (DHTs) and Random Peer Sampling (RPS) provide important and complementary services in the area of P2P overlay networks. DHTs achieve efficient lookup whil...
Marin Bertier, François Bonnet, Anne-Marie ...
GECCO
2010
Springer
207views Optimization» more  GECCO 2010»
14 years 1 months ago
Generalized crowding for genetic algorithms
Crowding is a technique used in genetic algorithms to preserve diversity in the population and to prevent premature convergence to local optima. It consists of pairing each offsp...
Severino F. Galán, Ole J. Mengshoel
MM
2009
ACM
203views Multimedia» more  MM 2009»
14 years 1 months ago
Distance metric learning from uncertain side information with application to automated photo tagging
Automated photo tagging is essential to make massive unlabeled photos searchable by text search engines. Conventional image annotation approaches, though working reasonably well o...
Lei Wu, Steven C. H. Hoi, Rong Jin, Jianke Zhu, Ne...