Sciweavers

6110 search results - page 350 / 1222
» Approximate Computing
Sort
View
FOCS
2009
IEEE
16 years 1 months ago
Settling the Complexity of Arrow-Debreu Equilibria in Markets with Additively Separable Utilities
We prove that the problem of computing an Arrow-Debreu market equilibrium is PPAD-complete even when all traders use additively separable, piecewise-linear and concave utility fun...
Xi Chen, Decheng Dai, Ye Du, Shang-Hua Teng
CVPR
2010
IEEE
16 years 3 months ago
Efficient Additive Kernels via Explicit Feature Maps
Maji and Berg [13] have recently introduced an explicit feature map approximating the intersection kernel. This enables efficient learning methods for linear kernels to be applied...
Andrea Vedaldi, Andrew Zisserman
147
Voted
CAD
2005
Springer
15 years 6 months ago
Geometric algorithms for rapidly reconfigurable mold manufacturing of free-form objects
This paper presents geometric algorithms for developing a re-configurable tooling system for fabrication of freeform objects. The proposed method involves a mold block, with n fac...
Aditya Kelkar, Rakesh Nagi, Bahattin Koc
ACMICEC
2007
ACM
102views ECommerce» more  ACMICEC 2007»
15 years 10 months ago
Learning to trade with insider information
This paper introduces algorithms for learning how to trade using insider (superior) information in Kyle's model of financial markets. Prior results in finance theory relied o...
Sanmay Das
ICWS
2009
IEEE
16 years 3 months ago
What are the Problem Makers: Ranking Activities According to their Relevance for Process Changes
Recently, a new generation of adaptive process management technology has emerged, which enables dynamic changes of composite services and process models respectively. This, in tur...
Chen Li, Manfred Reichert, Andreas Wombacher