2168 search results - page 61 / 434 » Randomized Algorithms and Complexity Theory |
128
Voted
ATAL
2006
Springer
15 years 6 months ago
2006
Springer
Encouraging voters to truthfully reveal their preferences in an election has long been an important issue. Previous studies have shown that some voting protocols are hard to manip...
122
click to vote
TIP
2010
14 years 9 months ago
2010
Color image demosaicking is a key process in the digital imaging pipeline. In this paper, we study a classical demosaicking algorithm based on alternating projections (AP), propos...
129
Voted
COMPGEOM
2010
ACM
15 years 7 months ago
2010
ACM
Normal surface theory is a central tool in algorithmic threedimensional topology, and the enumeration of vertex normal surfaces is the computational bottleneck in many important a...
126
click to vote
ECAI
1992
Springer
15 years 7 months ago
1992
Springer
ABSTRACT. This paper investigates the problem of finding subclasses of nonmonotonic reasoning which can be implemented efficiently. The ability to "define" propositions u...
137
click to vote
TCS
2010
14 years 9 months ago
2010
Uniform random generators deliver a simple empirical means to estimate the average complexity of an algorithm. We present a general rejection algorithm that generates sequential l...