Sciweavers

5785 search results - page 744 / 1157
» Approximability of Probability Distributions
Sort
View
ALMOB
2006
80views more  ALMOB 2006»
15 years 6 months ago
Effective p-value computations using Finite Markov Chain Imbedding (FMCI): application to local score and to pattern statistics
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...
Grégory Nuel
CSDA
2006
82views more  CSDA 2006»
15 years 6 months ago
Nearest neighbours in least-squares data imputation algorithms with different missing patterns
Methods for imputation of missing data in the so-called least-squares approximation approach, a non-parametric computationally efficient multidimensional technique, are experiment...
Ito Wasito, Boris Mirkin
JSAC
2006
128views more  JSAC 2006»
15 years 6 months ago
A framework for misuse detection in ad hoc networks- part II
We focus on detecting intrusions in ad hoc networks using the misuse detection technique. We allow for detection modules that periodically stop functioning due to operational failu...
D. Subhadrabandhu, S. Sarkar, F. Anjum
PE
2008
Springer
106views Optimization» more  PE 2008»
15 years 6 months ago
Heavy traffic analysis of polling models by mean value analysis
In this paper we present a new approach to derive heavy-traffic asymptotics for polling models. We consider the classical cyclic polling model with exhaustive or gated service at ...
Robert D. van der Mei, Erik M. M. Winands
TIT
2008
112views more  TIT 2008»
15 years 6 months ago
Rainbow Network Flow of Multiple Description Codes
This paper is an enquiry into the interaction between multiple description coding (MDC) and network routing. We are mainly concerned with rate-distortion optimized network flow of...
Xiaolin Wu, Bin Ma, Nima Sarshar