Sciweavers

75 search results - page 10 / 15
» Lower bounds for zero-dimensional projections
Sort
View
WDAG
1990
Springer
80views Algorithms» more  WDAG 1990»
13 years 11 months ago
Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
Ofer Biran, Shlomo Moran, Shmuel Zaks
STOC
2010
ACM
228views Algorithms» more  STOC 2010»
14 years 10 days ago
On the searchability of small-world networks with arbitrary underlying structure
Revisiting the “small-world” experiments of the ’60s, Kleinberg observed that individuals are very effective at constructing short chains of acquaintances between any two p...
Pierre Fraigniaud and George Giakkoupis
WWW
2010
ACM
14 years 2 months ago
Money, glory and cheap talk: analyzing strategic behavior of contestants in simultaneous crowdsourcing contests on TopCoder.com
Crowdsourcing is a new Web phenomenon, in which a firm takes a function once performed in-house and outsources it to a crowd, usually in the form of an open contest. Designing ef...
Nikolay Archak
ICCV
2001
IEEE
14 years 9 months ago
Multiple View Geometry of Non-planar Algebraic Curves
We introduce a number of new results in the context of multi-view geometry from general algebraic curves. We start with the derivation of the extended Kruppa's equations whic...
Jeremy Yermiyahou Kaminski, Michael Fryers, Amnon ...
STOC
2003
ACM
152views Algorithms» more  STOC 2003»
14 years 7 months ago
Reducing truth-telling online mechanisms to online optimization
We describe a general technique for converting an online algorithm B to a truthtelling mechanism. We require that the original online competitive algorithm has certain "nicen...
Baruch Awerbuch, Yossi Azar, Adam Meyerson