17.08.16 1:09:17 Optimal Dynamic Auctions for Durable Goods: Posted Prices and Fire-Sales
We consider a seller who wishes to sell K goods by time T. Potential buyers enter IID over time and are patient.
43
17.08.16 1:13:21 Mathematical Trading Strategies
Many trading strategies are based on perceived relationships between the prices of different assets. Some of these relationships are based on fundamental relationships e.g.
125 452
16.2
17.08.16 53:56 Greedy and Local Search Algorithms for Sparsity Constrained Optimization
Optimization problems with sparsity constraints have attracted much attention in recent years. There are two types of methods: convex relaxation such as L1 regularization and greedy algorithms.
513
170.7
17.08.16 1:23:16 Applying Physiologically-Motivated Models of Auditory Processing to Automatic Speech Recognition
For many years the human auditory system has been an inspiration for developers of automatic speech recognition systems because of its ability to interpret speech accurately in a wide variety of
60
17.08.16 46:40 Topology of Twitter: social network or news media?
Twitter, a microblogging service less than three years old, commands more than 41 million users as of July 2009 and is growing fast.
283
17.08.16 42:46 PacketShader: a GPU-Accelerated Software Router
PC-based software routers provide a cost-effective platform with easy extensibility and programmability. At the moment performance bottleneck of existing solutions lies in CPU.
926
20.2
17.08.16 41:56 Elliptic Curves, Group Law, and Efficient Computation
I will demonstrate techniques to derive the addition law on an arbitrary elliptic curve. The derived addition laws are applied to provide methods for efficiently adding points.
1 184
43.5
17.08.16 1:30:29 11
17.08.16 1:01:02 Approximate Clustering without the Approximation
There has been substantial work on approximation algorithms for clustering data under distance-based objective functions such as k-median, k-means, and min-sum objectives.
322
53.2
17.08.16 1:01:09 Simple stochastic games and a new class of total functions
Nash equilibrium, integer factorization, and stable configuration of a Hopfield net are examples of total functions, problems in NP that are guaranteed to always have solutions.
664
43.9
