Sciweavers

3946 search results - page 203 / 790
» The computational complexity of choice sets
Sort
View
COMPUTER
1999
95views more  COMPUTER 1999»
15 years 6 months ago
Wide-Area Computing: Resource Sharing on a Large Scale
abstract over a complex set of resources and provide a high-level way to share and manage them over the network. To be effective, such a system must address the challenges posed by...
Andrew S. Grimshaw, Adam Ferrari, Frederick Knabe,...
SIGMOD
1996
ACM
132views Database» more  SIGMOD 1996»
15 years 10 months ago
Cost-Based Optimization for Magic: Algebra and Implementation
Magic sets rewriting is a well-known optimization heuristic for complex decision-support queries. There can be many variants of this rewriting even for a single query, which diffe...
Praveen Seshadri, Joseph M. Hellerstein, Hamid Pir...
CRYPTO
2005
Springer
106views Cryptology» more  CRYPTO 2005»
16 years 5 days ago
Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems
Motivated by database search problems such as partial match or nearest neighbor, we present secure multiparty computation protocols for constant-depth circuits. Specifically, for ...
Omer Barkol, Yuval Ishai
AMC
2007
102views more  AMC 2007»
15 years 6 months ago
Existence and computation of short-run equilibria in economic geography
The new economic geography literature provides a general equilibrium framework that explains the emergence of economic agglomerations as a trade-off between increasing returns at...
Nicos G. Pavlidis, Michael N. Vrahatis, P. Mossay
SIGECOM
2006
ACM
142views ECommerce» more  SIGECOM 2006»
16 years 18 days ago
Computing the optimal strategy to commit to
In multiagent systems, strategic settings are often analyzed under the assumption that the players choose their strategies simultaneously. However, this model is not always realis...
Vincent Conitzer, Tuomas Sandholm