1996 search results - page 238 / 400 » Financial Theory 2 |
189
click to vote
SMA
2003
ACM
15 years 12 months ago
2003
ACM
Dimensional reduction is a simplification technique that eliminates one or more dimensions from a boundary value problem. It results in significant computational savings with mini...
194
click to vote
CSCW
2010
ACM
15 years 11 months ago
2010
ACM
Online peer-to-peer (P2P) lending organizations enable an individual to obtain an unsecured loan from a collection of individuals without the participation of a bank. Previous res...
177
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
188
Voted
STOC
2010
ACM
15 years 11 months ago
2010
ACM
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
181
click to vote
COLT
1999
Springer
15 years 11 months ago
1999
Springer
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...