901 search results - page 28 / 181 » Analyzing linear mergers |
WABI
2005
Springer
15 years 4 months ago
2005
Springer
Abstract Baharak Rastegari and Anne Condon Department of Computer Science, University of British Columbia Abstract. Accurate prediction of pseudoknotted RNA secondary structure is ...
COLT
2008
Springer
15 years 12 days ago
2008
Springer
Boosting algorithms build highly accurate prediction mechanisms from a collection of lowaccuracy predictors. To do so, they employ the notion of weak-learnability. The starting po...
109
click to vote
SAS
2010
Springer
14 years 9 months ago
2010
Springer
The efficiency of a points-to analysis is critical for several compiler optimizations and transformations, and has attracted considerable research attention. Despite several advanc...
MP
2011
14 years 5 months ago
2011
We perform a smoothed analysis of Renegar’s condition number for linear programming by analyzing the distribution of the distance to ill-posedness of a linear program subject to...
CRYPTO
2006
Springer
15 years 2 months ago
2006
Springer
Abstract. We study unconditionally secure 1-out-of-2 Oblivious Transfer (1-2 OT). We first point out that a standard security requirement for 1-2 OT of bits, namely that the receiv...