608 search results - page 118 / 122 » On Dependent Randomized Rounding Algorithms |
COLT
1999
Springer
15 years 1 months ago
1999
Springer
The empirical error on a test set, the hold-out estimate, often is a more reliable estimate of generalization error than the observed error on the training set, the training estim...
179
click to vote
NLP
2000
15 years 1 months ago
2000
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
102
Voted
DAGSTUHL
2007
14 years 11 months 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...
BMCBI
2007
14 years 9 months ago
2007
Background: To look for genetic linkage between angiotensin-I converting enzyme(ACE) gene and hypertension in a Korean adolescent cohort, we developed a powerful test using the co...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Collaborative beamforming (CB) is a power efficient method for data communications in wireless sensor networks (WSNs) which aims at increasing the transmission range in the network...