Sciweavers

167 search results - page 25 / 34
» A class of polynomially solvable linear complementarity prob...
Sort
View
104
Voted
STACS
1998
Springer
15 years 7 months ago
On Disguised Double Horn Functions and Extensions
We consider Boolean functions represented by decision lists, and study their relationships to other classes of Boolean functions. It turns out that the elementary class of 1-decis...
Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
154
Voted
ALT
2006
Springer
16 years 15 days ago
Learning Linearly Separable Languages
This paper presents a novel paradigm for learning languages that consists of mapping strings to an appropriate high-dimensional feature space and learning a separating hyperplane i...
Leonid Kontorovich, Corinna Cortes, Mehryar Mohri
116
Voted
DCOSS
2009
Springer
15 years 10 months ago
Cheap or Flexible Sensor Coverage
We consider dual classes of geometric coverage problems, in which disks, corresponding to coverage regions of sensors, are used to cover a region or set of points in the plane. The...
Amotz Bar-Noy, Theodore Brown, Matthew P. Johnson,...
125
Voted
WABI
2005
Springer
132views Bioinformatics» more  WABI 2005»
15 years 9 months ago
Perfect Sorting by Reversals Is Not Always Difficult
—We propose new algorithms for computing pairwise rearrangement scenarios that conserve the combinatorial structure of genomes. More precisely, we investigate the problem of sort...
Sèverine Bérard, Anne Bergeron, Cedr...
137
Voted
MP
2007
95views more  MP 2007»
15 years 3 months ago
Smoothed analysis of integer programming
We present a probabilistic analysis of integer linear programs (ILPs). More specifically, we study ILPs in a so-called smoothed analysis in which it is assumed that first an adve...
Heiko Röglin, Berthold Vöcking