Sciweavers

39 search results - page 7 / 8
» Polynomial Size Analysis of First-Order Functions
Sort
View
WINE
2009
Springer
178views Economy» more  WINE 2009»
14 years 26 days 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
12 years 9 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...
PODC
2006
ACM
14 years 7 days 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»
13 years 6 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»
14 years 25 days 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