2168 search results - page 175 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
110
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We study the power of nonadaptive quantum query algorithms, which are algorithms whose queries to the input do not depend on the result of previous queries. First, we show that an...
173
Voted
SIGECOM
2010
ACM
15 years 9 months ago
2010
ACM
The existing literature on optimal auctions focuses on optimizing the expected revenue of the seller, and is appropriate for risk-neutral sellers. In this paper, we identify good ...
101
click to vote
CVPR
1997
IEEE
15 years 8 months ago
1997
IEEE
ÐThe detection of smooth curves in images and their completion over gaps are two important problems in perceptual grouping. In this study, we examine the notion of completion ener...
137
click to vote
SIGECOM
2010
ACM
15 years 9 months ago
2010
ACM
This paper studies —from the perspective of efficient computation— a type of competition that is widespread throughout the plant and animal kingdoms, higher education, politic...
109
click to vote
ICDCSW
2002
IEEE
15 years 9 months ago
2002
IEEE
This paper addresses the fundamental tradeoffs in event systems between scalability (of event filtering, routing, and delivery mechanisms), expressiveness (when describing intere...