Sciweavers

39 search results - page 7 / 8
» Polynomial Size Analysis of First-Order Functions
Sort
View
86
Voted
WINE
2009
Springer
178views Economy» more  WINE 2009»
15 years 4 months ago
Computing Optimal Contracts in Series-Parallel Heterogeneous Combinatorial Agencies
We study an economic setting in which a principal motivates a team of strategic agents to exert costly effort toward the success of a joint project. The action taken by each agent...
Yuval Emek, Michal Feldman
COMPGEOM
2011
ACM
14 years 1 months ago
Comparing distributions and shapes using the kernel distance
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
Sarang C. Joshi, Raj Varma Kommaraju, Jeff M. Phil...
114
Voted
PODC
2006
ACM
15 years 3 months ago
Optimal-stretch name-independent compact routing in doubling metrics
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
Goran Konjevod, Andréa W. Richa, Donglin Xi...
IJDAR
2002
116views more  IJDAR 2002»
14 years 9 months ago
Performance evaluation of pattern classifiers for handwritten character recognition
Abstract. This paper describes a performance evaluation study in which some efficient classifiers are tested in handwritten digit recognition. The evaluated classifiers include a s...
Cheng-Lin Liu, Hiroshi Sako, Hiromichi Fujisawa
COCO
2009
Springer
121views Algorithms» more  COCO 2009»
15 years 4 months ago
Lower Bounds on Quantum Multiparty Communication Complexity
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
Troy Lee, Gideon Schechtman, Adi Shraibman