Sciweavers

478 search results - page 40 / 96
» Improving probability bounds by optimization over subsets
Sort
View
INFOCOM
1998
IEEE
13 years 12 months ago
TCP Fast Recovery Strategies: Analysis and Improvements
This paper suggests that, to match an ideal Internet gateway which rigorously enforces fair sharing among competing TCP connections, an ideal TCP sender should possess two propert...
Dong Lin, H. T. Kung
CORR
2006
Springer
113views Education» more  CORR 2006»
13 years 7 months ago
Towards the Optimal Amplify-and-Forward Cooperative Diversity Scheme
How to find a cooperative diversity scheme that achieves the transmit diversity bound is still an open problem. In fact, all previously proposed amplify-and-forward (AF) and decod...
Sheng Yang, Jean-Claude Belfiore
CRYPTO
2011
Springer
232views Cryptology» more  CRYPTO 2011»
12 years 7 months ago
Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
Structure-preserving signatures are signatures defined over bilinear groups that rely on generic group operations. In particular, the messages and signatures consist of group elem...
Masayuki Abe, Jens Groth, Kristiyan Haralambiev, M...
BMCBI
2004
181views more  BMCBI 2004»
13 years 7 months ago
Iterative class discovery and feature selection using Minimal Spanning Trees
Background: Clustering is one of the most commonly used methods for discovering hidden structure in microarray gene expression data. Most current methods for clustering samples ar...
Sudhir Varma, Richard Simon
KDD
2005
ACM
205views Data Mining» more  KDD 2005»
14 years 1 months ago
Feature bagging for outlier detection
Outlier detection has recently become an important problem in many industrial and financial applications. In this paper, a novel feature bagging approach for detecting outliers in...
Aleksandar Lazarevic, Vipin Kumar