491 search results - page 20 / 99 » Random Paintbrush Transformation |
102
Voted
TIT
2008
14 years 10 months ago
2008
Recently, it has been observed that a sparse trigonometric polynomial, i.e. having only a small number of non-zero coefficients, can be reconstructed exactly from a small number o...
82
Voted
SIGMETRICS
2006
ACM
15 years 4 months ago
2006
ACM
A new methodology to assess transient performance measures of tree-like processes is proposed by introducing the concept of tree-like processes with marked time epochs. As opposed...
87
Voted
TELETRAFFIC
2007
Springer
15 years 4 months ago
2007
Springer
We consider a fluid queue in discrete time with random service rate. Such a queue has been used in several recent studies on wireless networks where the packets can be arbitrarily...
WEA
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. The vertex cover problem is a classical NP-complete problem for which the best worst-case approximation ratio is 2− o(1). In this paper, we use a collection of simple g...
73
Voted
DAWAK
2005
Springer
15 years 3 months ago
2005
Springer
A biclustering algorithm, based on a greedy technique and enriched with a local search strategy to escape poor local minima, is proposed. The algorithm starts with an initial rando...