2766 search results - page 457 / 554 » Algorithms for trigonometric polynomials |
138
Voted
LICS
2009
IEEE
15 years 10 months ago
2009
IEEE
The search for an expressive calculus of datatypes in which canonical algorithms can be easily written and proven correct has proved to be an enduring challenge to the theoretical ...
127
Voted
WINE
2009
Springer
15 years 10 months ago
2009
Springer
We study the problem of identifying prices to support a given allocation of items to bidders in an envy-free way. A bidder will envy another bidder if she would prefer to obtain th...
126
click to vote
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
In this paper, we consider the design of an agent that is able to autonomously make optimal bundling decisions when selling multiple heterogeneous items within existing online auc...
128
click to vote
COCO
2009
Springer
15 years 10 months ago
2009
Springer
—We show that the rank of a depth-3 circuit (over any field) that is simple, minimal and zero is at most O(k3 log d). The previous best rank bound known was 2O(k2 ) (log d)k−2...
113
Voted
COCOA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We study Facility Location games played by n agents situated on the nodes of a graph. Each agent orders installation of a facility at a node of the graph and pays connect...