Sciweavers

1897 search results - page 230 / 380
» Conditional Linear Planning
Sort
View
ICML
2007
IEEE
16 years 4 months ago
Full regularization path for sparse principal component analysis
Given a sample covariance matrix, we examine the problem of maximizing the variance explained by a particular linear combination of the input variables while constraining the numb...
Alexandre d'Aspremont, Francis R. Bach, Laurent El...
DCC
2006
IEEE
16 years 2 months ago
A New Characterization of Semi-bent and Bent Functions on Finite Fields*
We present a new characterization of semi-bent and bent quadratic functions on finite fields. First, we determine when a GF(2)-linear combination of Gold functions Tr(x2i +1 ) is ...
Khoongming Khoo, Guang Gong, Douglas R. Stinson
LOCA
2009
Springer
15 years 9 months ago
Location Diversity: Enhanced Privacy Protection in Location Based Services
Abstract. Location-based Services are emerging as popular applications in pervasive computing. Spatial k-anonymity is used in Locationbased Services to protect privacy, by hiding t...
Mingqiang Xue, Panos Kalnis, Hung Keng Pung
SIGECOM
2009
ACM
114views ECommerce» more  SIGECOM 2009»
15 years 9 months ago
Policy teaching through reward function learning
Policy teaching considers a Markov Decision Process setting in which an interested party aims to influence an agent’s decisions by providing limited incentives. In this paper, ...
Haoqi Zhang, David C. Parkes, Yiling Chen
GLOBECOM
2007
IEEE
15 years 9 months ago
Distributed Maximum Lifetime Routing in Wireless Sensor Networks Based on Regularization
— The maximum lifetime routing problem in wireless sensor networks has received increasing attention in recent years. One way is to formulate it as a linear programming problem b...
Vahid Shah-Mansouri, Vincent W. S. Wong