Sciweavers

9604 search results - page 38 / 1921
» The Duality of TIme and Information
Sort
View
DAC
2010
ACM
15 years 1 months ago
Lattice-based computation of Boolean functions
This paper studies the implementation of Boolean functions with lattices of two-dimensional switches. Each switch is controlled by a Boolean literal. If the literal is 1, the swit...
Mustafa Altun, Marc D. Riedel
COMPGEOM
1995
ACM
15 years 1 months ago
How Good are Convex Hull Algorithms?
A convex polytope P can be speci ed in two ways: as the convex hull of the vertex set V of P, or as the intersection of the set H of its facet-inducing halfspaces. The vertex enum...
David Avis, David Bremner
STOC
1995
ACM
194views Algorithms» more  STOC 1995»
15 years 1 months ago
Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals
Genomes frequently evolve by reversals ␳(i, j) that transform a gene order ␲1 . . . ␲i␲iϩ1 . . . ␲jϪ1␲j . . . ␲n into ␲1 . . . ␲i␲jϪ1 . . . ␲iϩ1␲j . . ....
Sridhar Hannenhalli, Pavel A. Pevzner
SIAMAM
2008
74views more  SIAMAM 2008»
14 years 9 months ago
Optimal Liquidation by a Large Investor
Abstract. We develop a partial equilibrium model to investigate the problem of optimal liquidation over a finite or infinite time horizon for an investor with large holdings in a r...
Ajay Subramanian
62
Voted
TIT
2008
80views more  TIT 2008»
14 years 9 months ago
Entropy Amplification Property and the Loss for Writing on Dirty Paper
Costa's celebrated "writing on dirty paper" (WDP) shows that the powerconstrained channel Y = X + S + Z, with Gaussian Z, has the same capacity as the standard AWGN...
Aaron S. Cohen, Ram Zamir