1603 search results - page 161 / 321 » Universal Confidence Sets for Solutions of Optimization Prob... |
180
click to vote
PSD
2004
Springer
16 years 10 days ago
2004
Springer
Minimum-distance controlled perturbation is a recent family of methods for the protection of statistical tabular data. These methods are both efficient and versatile, since can dea...
210
click to vote
GLOBECOM
2006
IEEE
16 years 1 months ago
2006
IEEE
— Multiple description coding (MDC) has emerged as a powerful technique for reliable real-time communications over lossy packet networks. In its basic form, it involves encoding ...
206
click to vote
ICML
2003
IEEE
16 years 7 months ago
2003
IEEE
Convex programming involves a convex set F Rn and a convex cost function c : F R. The goal of convex programming is to find a point in F which minimizes c. In online convex prog...
190
click to vote
SPAA
2006
ACM
16 years 29 days ago
2006
ACM
Consider a network in which a collection of source nodes maintain and periodically update data objects for a collection of sink nodes, each of which periodically accesses the data...
190
Voted
ICCV
2003
IEEE
16 years 9 months ago
2003
IEEE
We propose a principled account on multiclass spectral clustering. Given a discrete clustering formulation, we first solve a relaxed continuous optimization problem by eigendecomp...