608 search results - page 68 / 122 » On Dependent Randomized Rounding Algorithms |
SIGMETRICS
2010
ACM
14 years 1 months ago
2010
ACM
This paper addresses the problem of determining the node locations in ad-hoc sensor networks when only connectivity information is available. In previous work, we showed that the ...
BMCBI
2010
13 years 9 months ago
2010
Background: The amount of available biological information is rapidly increasing and the focus of biological research has moved from single components to networks and even larger ...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
Abstract.1 The scheme of the sliding window is known in Information Theory, Computer Science, the problem of predicting and in stastistics. Let a source with unknown statistics gen...
AUSAI
2007
Springer
14 years 3 months ago
2007
Springer
Dimensional reduction may be effective in order to compress data without loss of essential information. Also, it may be useful in order to smooth data and reduce random noise. The...
ALMOB
2008
13 years 9 months ago
2008
The increasing throughput of sequencing raises growing needs for methods of sequence analysis and comparison on a genomic scale, notably, in connection with phylogenetic tree reco...