Sciweavers

358 search results - page 65 / 72
» On the Distributed Complexity of Computing Maximal Matchings
Sort
View
SPAA
2003
ACM
15 years 7 months ago
Information gathering in adversarial systems: lines and cycles
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...
Kishore Kothapalli, Christian Scheideler
IPPS
2010
IEEE
14 years 11 months ago
Acceleration of spiking neural networks in emerging multi-core and GPU architectures
Recently, there has been strong interest in large-scale simulations of biological spiking neural networks (SNN) to model the human brain mechanisms and capture its inference capabi...
Mohammad A. Bhuiyan, Vivek K. Pallipuram, Melissa ...
ICNP
2003
IEEE
15 years 7 months ago
Matchmaker: Signaling for Dynamic Publish/Subscribe Applications
The publish/subscribe (pub/sub) paradigm provides content-oriented data dissemination in which communication channels are established between content publishers and content subscr...
Zihui Ge, Ping Ji, James F. Kurose, Donald F. Tows...
SIGECOM
2010
ACM
170views ECommerce» more  SIGECOM 2010»
15 years 6 months ago
Optimal online assignment with forecasts
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
Erik Vee, Sergei Vassilvitskii, Jayavel Shanmugasu...
159
Voted
GECCO
2009
Springer
258views Optimization» more  GECCO 2009»
15 years 6 months ago
Evolutionary learning of local descriptor operators for object recognition
Nowadays, object recognition is widely studied under the paradigm of matching local features. This work describes a genetic programming methodology that synthesizes mathematical e...
Cynthia B. Pérez, Gustavo Olague