1456 search results - page 168 / 292 » Improved Randomized Results for That Interval Selection Prob... |
109
Voted
DAGSTUHL
2007
15 years 10 days ago
2007
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...
CORR
2011
Springer
14 years 5 months ago
2011
Springer
Countless variants of the Lempel-Ziv compression are widely used in many real-life applications. This paper is concerned with a natural modification of the classical pattern match...
CEC
2009
IEEE
15 years 3 months ago
2009
IEEE
— The protein structure prediction (PSP) problem is one of the most important problems in computational biology. This paper proposes a novel Estimation of Distribution Algorithms...
100
click to vote
TIT
2010
14 years 5 months ago
2010
In this paper, we study the number of measurements required to recover a sparse signal in M with L nonzero coefficients from compressed samples in the presence of noise. We conside...
116
Voted
ICDCS
2006
IEEE
15 years 5 months ago
2006
IEEE
Distributed hash table (DHT) networks based on consistent hashing functions have an inherent load balancing problem. The problem becomes more severe due to the heterogeneity of ne...