Sciweavers

1806 search results - page 83 / 362
» Some Functions Computable with a Fused-Mac
Sort
View
WINE
2009
Springer
93views Economy» more  WINE 2009»
16 years 14 days ago
On Stackelberg Pricing with Computationally Bounded Consumers
In a Stackelberg pricing game a leader aims to set prices on a subset of a given collection of items, such as to maximize her revenue from a follower purchasing a feasible subset o...
Patrick Briest, Martin Hoefer, Luciano Gualà...
SIGMOD
2007
ACM
165views Database» more  SIGMOD 2007»
16 years 6 months ago
Sharing aggregate computation for distributed queries
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be i...
Ryan Huebsch, Minos N. Garofalakis, Joseph M. Hell...
WFLP
2000
Springer
124views Algorithms» more  WFLP 2000»
15 years 9 months ago
A Formal Approach to Reasoning about the Effectiveness of Partial Evaluation
We introduce a framework for assessing the effectiveness of partial evaluators in functional logic languages. Our framework is based on properties of the rewrite system that models...
Elvira Albert, Sergio Antoy, Germán Vidal
CORR
2007
Springer
74views Education» more  CORR 2007»
15 years 5 months ago
Secure Two-party Protocols for Point Inclusion Problem
It is well known that, in theory, the general secure multiparty computation problem is solvable using circuit evaluation protocols. However, the communication complexity of the re...
Tony Thomas
COR
2008
124views more  COR 2008»
15 years 6 months ago
Max-min fairness in multi-commodity flows
In this paper, we provide a study of Max-Min Fair (MMF) multicommodity flows and focus on some of their applications to multi-commodity networks. We first present the theoretical ...
Dritan Nace, Nhat Linh Doan, Olivier Klopfenstein,...