Sciweavers

207 search results - page 33 / 42
» Convexity of the Proximal Average
Sort
View
MICRO
1999
IEEE
143views Hardware» more  MICRO 1999»
14 years 26 days ago
Code Transformations to Improve Memory Parallelism
Current microprocessors incorporate techniques to exploit instruction-level parallelism (ILP). However, previous work has shown that these ILP techniques are less effective in rem...
Vijay S. Pai, Sarita V. Adve
NIPS
2008
13 years 10 months ago
Partially Observed Maximum Entropy Discrimination Markov Networks
Learning graphical models with hidden variables can offer semantic insights to complex data and lead to salient structured predictors without relying on expensive, sometime unatta...
Jun Zhu, Eric P. Xing, Bo Zhang
IPCO
2007
98views Optimization» more  IPCO 2007»
13 years 10 months ago
Scheduling with Precedence Constraints of Low Fractional Dimension
Abstract. We consider the single machine scheduling problem to minimize the average weighted completion time under precedence constrains. Improving on the various 2-approximation a...
Christoph Ambühl, Monaldo Mastrolilli, Nikola...
NIPS
2004
13 years 10 months ago
Variational Minimax Estimation of Discrete Distributions under KL Loss
We develop a family of upper and lower bounds on the worst-case expected KL loss for estimating a discrete distribution on a finite number m of points, given N i.i.d. samples. Our...
Liam Paninski
CISS
2007
IEEE
13 years 8 months ago
Robust Routing in Wireless Multi-Hop Networks
This paper introduces a robust approach to stochastic multi-hop routing for wireless networks when the quality of links is modelled through a reliability matrix R. Yielding to the ...
Yuchen Wu, Alejandro Ribeiro, Georgios B. Giannaki...