Sciweavers

134 search results - page 10 / 27
» Experimental analysis of privacy loss in DCOP algorithms
Sort
View
CORR
2011
Springer
127views Education» more  CORR 2011»
14 years 1 months ago
Generalized Boosting Algorithms for Convex Optimization
Boosting is a popular way to derive powerful learners from simpler hypothesis classes. Following previous work (Mason et al., 1999; Friedman, 2000) on general boosting frameworks,...
Alexander Grubb, J. Andrew Bagnell
PAMI
2008
135views more  PAMI 2008»
14 years 9 months ago
MultiK-MHKS: A Novel Multiple Kernel Learning Algorithm
In this paper, we develop a new effective multiple kernel learning algorithm. First, we map the input data into m different feature spaces by m empirical kernels, where each genera...
Zhe Wang, Songcan Chen, Tingkai Sun
SDMW
2009
Springer
15 years 4 months ago
Controlling Access to XML Documents over XML Native and Relational Databases
In this paper we investigate the feasibility and efficiency of mapping XML data and access control policies onto relational and native XML databases for storage and querying. We de...
Lazaros Koromilas, George Chinis, Irini Fundulaki,...
IMC
2010
ACM
14 years 7 months ago
Challenges in measuring online advertising systems
Online advertising supports many Internet services, such as search, email, and social networks. At the same time, there are widespread concerns about the privacy loss associated w...
Saikat Guha, Bin Cheng, Paul Francis
NIPS
2007
14 years 11 months ago
A General Boosting Method and its Application to Learning Ranking Functions for Web Search
We present a general boosting method extending functional gradient boosting to optimize complex loss functions that are encountered in many machine learning problems. Our approach...
Zhaohui Zheng, Hongyuan Zha, Tong Zhang, Olivier C...