Sciweavers

350 search results - page 61 / 70
» On the symmetry function of a convex set
Sort
View
98
Voted
KDD
2010
ACM
245views Data Mining» more  KDD 2010»
15 years 1 months ago
Learning incoherent sparse and low-rank patterns from multiple tasks
We consider the problem of learning incoherent sparse and lowrank patterns from multiple tasks. Our approach is based on a linear multi-task learning formulation, in which the spa...
Jianhui Chen, Ji Liu, Jieping Ye
CORR
2012
Springer
170views Education» more  CORR 2012»
13 years 6 months ago
What Cannot be Learned with Bethe Approximations
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
Uri Heinemann, Amir Globerson
TIT
1998
112views more  TIT 1998»
14 years 10 months ago
Application of Network Calculus to Guaranteed Service Networks
—We use recent network calculus results to study some properties of lossless multiplexing as it may be used in guaranteed service networks. We call network calculus a set of resu...
Jean-Yves Le Boudec
STOC
2007
ACM
146views Algorithms» more  STOC 2007»
15 years 11 months ago
Playing games with approximation algorithms
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...
Sham M. Kakade, Adam Tauman Kalai, Katrina Ligett
110
Voted
DAC
2007
ACM
16 years 1 days ago
Period Optimization for Hard Real-time Distributed Automotive Systems
The complexity and physical distribution of modern active-safety automotive applications requires the use of distributed architectures. These architectures consist of multiple ele...
Abhijit Davare, Qi Zhu, Marco Di Natale, Claudio P...