Sciweavers

150 search results - page 21 / 30
» Optimization on the Orthogonal Group for Independent Compone...
Sort
View
CORR
2007
Springer
124views Education» more  CORR 2007»
15 years 11 days ago
Anonymous Networking amidst Eavesdroppers
—The problem of security against packet timing based traffic analysis in wireless networks is considered in this work. An analytical measure of “anonymity” of routes in eave...
Parvathinathan Venkitasubramaniam, Ting He, Lang T...
115
Voted
IJON
1998
158views more  IJON 1998»
15 years 2 days ago
Bayesian Kullback Ying-Yang dependence reduction theory
Bayesian Kullback Ying—Yang dependence reduction system and theory is presented. Via stochastic approximation, implementable algorithms and criteria are given for parameter lear...
Lei Xu
86
Voted
DOCENG
2003
ACM
15 years 5 months ago
Two diet plans for fat PDF
As Adobe's Portable Document Format has exploded in popularity so too has the number PDF generators, and predictably the quality of generated PDF varies considerably. This pa...
Thomas A. Phelps, Robert Wilensky
139
Voted
KDD
2012
ACM
207views Data Mining» more  KDD 2012»
13 years 2 months ago
Robust multi-task feature learning
Multi-task learning (MTL) aims to improve the performance of multiple related tasks by exploiting the intrinsic relationships among them. Recently, multi-task feature learning alg...
Pinghua Gong, Jieping Ye, Changshui Zhang
APPROX
2010
Springer
188views Algorithms» more  APPROX 2010»
15 years 1 months ago
Approximation Algorithms for Reliable Stochastic Combinatorial Optimization
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
Evdokia Nikolova