Sciweavers

1996 search results - page 227 / 400
» Financial Theory 2
Sort
View
TIT
2008
86views more  TIT 2008»
15 years 6 months ago
A One-to-One Code and Its Anti-Redundancy
One-to-one codes are "one shot" codes that assign a distinct codeword to source symbols and are not necessarily prefix codes (more generally, uniquely decodable). For ex...
Wojciech Szpankowski
CORR
2004
Springer
119views Education» more  CORR 2004»
15 years 6 months ago
The Largest Compatible Subset Problem for Phylogenetic Data
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...
Andy Auyeung, Ajith Abraham
EATCS
2000
85views more  EATCS 2000»
15 years 6 months ago
A New Zero-One Law and Strong Extension Axioms
One of the previous articles in this column was devoted to the zero-one laws for a number of logics playing prominent role in finite model theory: first-order logic FO, the extens...
Andreas Blass, Yuri Gurevich
COMGEO
1999
ACM
15 years 6 months ago
Point labeling with sliding labels
This paper discusses algorithms for labeling sets of points in the plane, where labels are not restricted to some finite number of positions. We show that continuously sliding lab...
Marc J. van Kreveld, Tycho Strijk, Alexander Wolff
JACM
1998
88views more  JACM 1998»
15 years 6 months ago
A Threshold of ln n for Approximating Set Cover
Given a collection Ᏺ of subsets of S ϭ {1, . . . , n}, set cover is the problem of selecting as few as possible subsets from Ᏺ such that their union covers S, and max k-cover ...
Uriel Feige