4110 search results - page 38 / 822 » Efficient algorithms for the 2-gathering problem |
95
Voted
ALGORITHMICA
2010
15 years 3 months ago
2010
The Burrows-Wheeler transformation is used for effective data compression, e.g., in the well known program bzip2. Compression and decompression are done in a block-wise fashion; la...
113
Voted
ESA
2010
Springer
15 years 3 months ago
2010
Springer
The two dimensional range minimum query problem is to preprocess a static two dimensional m by n array A of size N = m
116
Voted
ICARIS
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. String-based negative selection is an immune-inspired classification scheme: Given a self-set S of strings, generate a set D of detectors that do not match any element of...
143
Voted
NIPS
2001
15 years 5 months ago
2001
The paper studies machine learning problems where each example is described using a set of Boolean features and where hypotheses are represented by linear threshold elements. One ...
169
Voted
ATAL
2008
Springer
15 years 5 months ago
2008
Springer
In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the other agent (the follower or adversary) before the adv...