Sciweavers

3466 search results - page 649 / 694
» Fast computation of special resultants
Sort
View
FOCS
2006
IEEE
14 years 5 months ago
On the Quantum Query Complexity of Local Search in Two and Three Dimensions
The quantum query complexity of searching for local optima has been a subject of much interest in the recent literature. For the d-dimensional grid graphs, the complexity has been...
Xiaoming Sun, Andrew Chi-Chih Yao
SIGECOM
2006
ACM
96views ECommerce» more  SIGECOM 2006»
14 years 5 months ago
Non-cooperative multicast and facility location games
We consider a multicast game with selfish non-cooperative players. There is a special source node and each player is interested in connecting to the source by making a routing de...
Chandra Chekuri, Julia Chuzhoy, Liane Lewin-Eytan,...
CASSIS
2005
Springer
14 years 4 months ago
The Architecture of a Privacy-Aware Access Control Decision Component
Today many interactions are carried out online through Web sites and e-services and often private and/or sensitive information is required by service providers. A growing concern r...
Claudio Agostino Ardagna, Marco Cremonini, Ernesto...
WINE
2005
Springer
161views Economy» more  WINE 2005»
14 years 4 months ago
Design of Incentive Compatible Mechanisms for Stackelberg Problems
This paper takes the first steps towards designing incentive compatible mechanisms for hierarchical decision making problems involving selfish agents. We call these Stackelberg p...
Dinesh Garg, Yadati Narahari
ISPD
2004
ACM
189views Hardware» more  ISPD 2004»
14 years 4 months ago
Almost optimum placement legalization by minimum cost flow and dynamic programming
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
Ulrich Brenner, Anna Pauli, Jens Vygen