Sciweavers

118 search results - page 16 / 24
» Some Results on Generalized Coherence of Conditional Probabi...
Sort
View
STOC
2009
ACM
99views Algorithms» more  STOC 2009»
15 years 10 months ago
Testing juntas nearly optimally
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
Eric Blais
OA
1989
237views Algorithms» more  OA 1989»
15 years 1 months ago
Which Triangulations Approximate the Complete Graph?
nce Abstract) 1 GAUTAM DAS - University of Wisconsin DEBORAH JOSEPH - University of Wisconsin Chew and Dobkin et. al. have shown that the Delaunay triangulation and its variants ar...
Gautam Das, Deborah Joseph
CORR
2006
Springer
129views Education» more  CORR 2006»
14 years 9 months ago
On the Optimality of the ARQ-DDF Protocol
The performance of the automatic repeat request-dynamic decode and forward (ARQ-DDF) cooperation protocol is analyzed in two distinct scenarios. The first scenario is the multiple...
Kambiz Azarian, Hesham El Gamal, Philip Schniter
LCN
2008
IEEE
15 years 4 months ago
An analysis on error servers for stochastic network calculus
—Network calculus is a recently developed theory dealing with queuing systems found in computer networks with focus on service guarantee analysis. In the current network calculus...
Jing Xie, Yuming Jiang
98
Voted
JMLR
2010
143views more  JMLR 2010»
14 years 8 months ago
A Quasi-Newton Approach to Nonsmooth Convex Optimization Problems in Machine Learning
We extend the well-known BFGS quasi-Newton method and its memory-limited variant LBFGS to the optimization of nonsmooth convex objectives. This is done in a rigorous fashion by ge...
Jin Yu, S. V. N. Vishwanathan, Simon Günter, ...