429 search results - page 36 / 86 » Improved Algorithms for the k Maximum-Sums Problems |
COCOA
2010
Springer
14 years 8 months ago
2010
Springer
In a network environments supporting mobile entities (called robots or agents), a black hole is harmful site that destroys any incoming entity without leaving any visible trace. Th...
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
We present algorithms for improved Viterbi decoding for the case of hidden semi-Markov models. By carefully constructing directed acyclic graphs, we pose the decoding problem as t...
IPL
2010
14 years 8 months ago
2010
We study the problem of learning parity functions that depend on at most k variables (kparities) attribute-efficiently in the mistake-bound model. We design a simple, deterministi...
COCOON
2005
Springer
15 years 3 months ago
2005
Springer
Abstract In this paper, we study the problem of supporting range sum queries on a compressed sequence of values. For a sequence of n k-bit integers, k ≤ O(log n), our data struct...
AAAI
2010
14 years 11 months ago
2010
We consider approval voting elections in which each voter votes for a (possibly empty) set of candidates and the outcome consists of a set of k candidates for some parameter k, e....