Sciweavers

730 search results - page 50 / 146
» Combinatorics of Monotone Computations
Sort
View
COMBINATORICS
2007
112views more  COMBINATORICS 2007»
13 years 8 months ago
Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set
In the last decade there has been an ongoing interest in string comparison problems; to a large extend the interest was stimulated by genome rearrangement problems in computationa...
Petr Kolman, Tomasz Walen
IACR
2011
152views more  IACR 2011»
12 years 8 months ago
Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
Abstract. In Asiacrypt 2010, Groth constructed the only previously known sublinearcommunication NIZK argument for circuit satisfiability in the common reference string model. We p...
Helger Lipmaa
CVPR
2012
IEEE
11 years 11 months ago
Unsupervised learning of translation invariant occlusive components
We study unsupervised learning of occluding objects in images of visual scenes. The derived learning algorithm is based on a probabilistic generative model which parameterizes obj...
Zhenwen Dai, Jörg Lücke
CPM
2010
Springer
140views Combinatorics» more  CPM 2010»
14 years 1 months ago
Bounds on the Minimum Mosaic of Population Sequences under Recombination
We study the minimum mosaic problem, an optimization problem originated in population genomics. We develop a new lower bound, called the C bound. The C bound is provably higher and...
Yufeng Wu
COCOON
2011
Springer
12 years 8 months ago
Proper n-Cell Polycubes in n - 3 Dimensions
A d-dimensional polycube of size n is a connected set of n cubes in d dimensions, where connectivity is through (d−1)-dimensional faces. Enumeration of polycubes, and, in particu...
Andrei Asinowski, Gill Barequet, Ronnie Barequet, ...