Sciweavers

1158 search results - page 181 / 232
» Software is discrete mathematics
Sort
View
STOC
1993
ACM
123views Algorithms» more  STOC 1993»
14 years 1 months ago
Constructing small sample spaces satisfying given constraints
Abstract. The subject of this paper is nding small sample spaces for joint distributions of n discrete random variables. Such distributions are often only required to obey a certa...
Daphne Koller, Nimrod Megiddo
CCS
2001
ACM
14 years 1 months ago
A verifiable secret shuffle and its application to e-voting
We present a mathematical construct which provides a cryptographic protocol to verifiably shuffle a sequence of k modular integers, and discuss its application to secure, universa...
C. Andrew Neff
SIGGRAPH
1995
ACM
14 years 1 months ago
Intelligent scissors for image composition
We present a new, interactive tool called Intelligent Scissors which we use for image segmentation and composition. Fully automated segmentation is an unsolved problem, while manu...
Eric N. Mortensen, William A. Barrett
STOC
1991
ACM
84views Algorithms» more  STOC 1991»
14 years 1 months ago
Self-Testing/Correcting for Polynomials and for Approximate Functions
The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-te...
Peter Gemmell, Richard J. Lipton, Ronitt Rubinfeld...
APPROX
2008
Springer
142views Algorithms» more  APPROX 2008»
13 years 11 months ago
Approximating Maximum Subgraphs without Short Cycles
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
Guy Kortsarz, Michael Langberg, Zeev Nutov