600 search results - page 9 / 120 » Problems and results in extremal combinatorics - II |
CPM
2009
Springer
13 years 4 months ago
2009
Springer
The longest-common-prefix (LCP) array is an adjunct to the suffix array that allows many string processing problems to be solved in optimal time and space. Its construction is a bo...
COCOON
2007
Springer
14 years 1 months ago
2007
Springer
We give efficient distributed approximation algorithms for weighted versions of the maximum matching problem and the minimum dominating set problem for graphs from minor-closed fam...
INFOCOM
2009
IEEE
14 years 1 months ago
2009
IEEE
Abstract—The advent of practical rateless codes enables implementation of highly efficient packet-level forward error correction (FEC) strategies for reliable data broadcasting ...
JIDM
2010
13 years 5 months ago
2010
One of the most important challenges for the researchers in the 21st Century is related to global heating and climate change that can have as consequence the intensification of na...
IJAR
2010
13 years 4 months ago
2010
In this paper we present TANC, i.e., a tree-augmented naive credal classifier based on imprecise probabilities; it models prior near-ignorance via the Extreme Imprecise Dirichlet ...