Sciweavers

531 search results - page 97 / 107
» A Better Algorithm for Random k-SAT
Sort
View
81
Voted
EUROGRAPHICS
2010
Eurographics
14 years 10 months ago
Contrast-aware Halftoning
This paper proposes two variants of a simple but efficient algorithm for structure-preserving halftoning. Our algorithm extends Floyd-Steinberg error diffusion; the goal of our ex...
Hua Li and David Mould
JCSS
2010
91views more  JCSS 2010»
14 years 8 months ago
Content-dependent chunking for differential compression, the local maximum approach
When a file is to be transmitted from a sender to a recipient and when the latter already has a file somewhat similar to it, remote differential compression seeks to determine t...
Nikolaj Bjørner, Andreas Blass, Yuri Gurevi...
DAC
2007
ACM
15 years 10 months ago
An Effective Guidance Strategy for Abstraction-Guided Simulation
tive Guidance Strategy for Abstraction-Guided Simulation Flavio M. De Paula Alan J. Hu Department of Computer Science, University of British Columbia, {depaulfm, ajh}@cs.ubc.ca D...
Flavio M. de Paula, Alan J. Hu
COCO
2007
Springer
88views Algorithms» more  COCO 2007»
15 years 3 months ago
A New Interactive Hashing Theorem
Interactive hashing, introduced by Naor, Ostrovsky, Venkatesan and Yung (CRYPTO ’92), plays an important role in many cryptographic protocols. In particular, it is a major compo...
Iftach Haitner, Omer Reingold
GECCO
2009
Springer
15 years 2 months ago
The sensitivity of HyperNEAT to different geometric representations of a problem
HyperNEAT, a generative encoding for evolving artificial neural networks (ANNs), has the unique and powerful ability to exploit the geometry of a problem (e.g., symmetries) by enc...
Jeff Clune, Charles Ofria, Robert T. Pennock