Sciweavers

2027 search results - page 154 / 406
» When is it best to best-respond
Sort
View
JMLR
2010
91views more  JMLR 2010»
14 years 8 months ago
Composite Binary Losses
We study losses for binary classification and class probability estimation and extend the understanding of them from margin losses to general composite losses which are the compos...
Mark D. Reid, Robert C. Williamson
PAA
2010
14 years 8 months ago
A comparative study on feature extraction for fingerprint classification and performance improvements using rank-level fusion
Abstract Fingerprint classification represents an important preprocessing step in fingerprint identification, which can be very helpful in reducing the cost of searching large fing...
Uday Rajanna, Ali Erol, George Bebis
SODA
2012
ACM
240views Algorithms» more  SODA 2012»
13 years 3 months ago
Simultaneous approximations for adversarial and stochastic online budgeted allocation
Motivated by online ad allocation, we study the problem of simultaneous approximations for the adversarial and stochastic online budgeted allocation problem. This problem consists...
Vahab S. Mirrokni, Shayan Oveis Gharan, Morteza Za...
SIGECOM
2009
ACM
91views ECommerce» more  SIGECOM 2009»
15 years 7 months ago
Destroy to save
We study the problem of how to allocate m identical items among n > m agents, assuming each agent desires exactly one item and has a private value for consuming the item. We as...
Geoffroy de Clippel, Victor Naroditskiy, Amy R. Gr...
PLDI
2006
ACM
15 years 7 months ago
Free-Me: a static analysis for automatic individual object reclamation
Garbage collection has proven benefits, including fewer memoryrelated errors and reduced programmer effort. Garbage collection, however, trades space for time. It reclaims memory...
Samuel Z. Guyer, Kathryn S. McKinley, Daniel Framp...