Sciweavers

4323 search results - page 138 / 865
» Callback Implementations in C
Sort
View
CSC
2009
13 years 11 months ago
An Empirical Analysis of Approximation Algorithms for Euclidean TSP
- The Traveling Salesman Problem (TSP) is perhaps the most famous optimization problem in the set NP-hard. Many problems that are natural applications in computer science and engin...
Bárbara Rodeker, M. Virginia Cifuentes, Lil...
COGSR
2011
99views more  COGSR 2011»
13 years 5 months ago
A biologically realistic cleanup memory: Autoassociation in spiking neurons
Methods for cleaning up (or recognizing) states of a neural network are crucial for the functioning of many neural cognitive models. For example, Vector Symbolic Architectures pro...
Terrence C. Stewart, Yichuan Tang, Chris Eliasmith
JMLR
2011
106views more  JMLR 2011»
13 years 5 months ago
A Bayesian Approximation Method for Online Ranking
This paper describes a Bayesian approximation method to obtain online ranking algorithms for games with multiple teams and multiple players. Recently for Internet games large onli...
Ruby C. Weng, Chih-Jen Lin
JOC
2011
102views more  JOC 2011»
13 years 5 months ago
Wildcarded Identity-Based Encryption
In this paper we introduce a new primitive called identity-based encryption with wildcards, or WIBE for short. It allows a sender to encrypt messages to a whole range of receivers ...
Michel Abdalla, James Birkett, Dario Catalano, Ale...
SIAMNUM
2011
139views more  SIAMNUM 2011»
13 years 5 months ago
Adaptive Wavelet Schemes for Parabolic Problems: Sparse Matrices and Numerical Results
A simultaneous space-time variational formulation of a parabolic evolution problem is solved with an adaptive wavelet method. This method is shown to converge with the best possibl...
Nabi Chegini, Rob Stevenson