10988 search results - page 260 / 2198 » Algorithmic Folding Complexity |
139
Voted
CAD
2005
Springer
15 years 4 months ago
2005
Springer
Since the publication of the original Marching Cubes algorithm, numerous variations have been proposed for guaranteeing water-tight constructions of triangulated approximations of...
118
click to vote
ECCC
2010
15 years 2 months ago
2010
We investigate the problem of local reconstruction, as defined by Saks and Seshadhri (2008), in the context of error correcting codes. The first problem we address is that of me...
143
click to vote
JSAC
2011
14 years 11 months ago
2011
—Due to the potential of enhancing traffic safety, protecting environment, and enabling new applications, vehicular communications, especially vehicle-to-vehicle (V2V) communica...
136
click to vote
STOC
2007
ACM
16 years 4 months ago
2007
ACM
We give an exponential separation between one-way quantum and classical communication protocols for two partial Boolean functions, both of which are variants of the Boolean Hidden...
139
click to vote
STOC
2005
ACM
16 years 4 months ago
2005
ACM
A celebrated 1976 theorem of Aumann asserts that honest, rational Bayesian agents with common priors will never "agree to disagree": if their opinions about any topic ar...