Sciweavers

5387 search results - page 353 / 1078
» Generating generic functions
Sort
View
PAMI
2011
15 years 1 months ago
Semi-Supervised Learning via Regularized Boosting Working on Multiple Semi-Supervised Assumptions
—Semi-supervised learning concerns the problem of learning in the presence of labeled and unlabeled data. Several boosting algorithms have been extended to semi-supervised learni...
Ke Chen, Shihai Wang
STOC
2007
ACM
112views Algorithms» more  STOC 2007»
16 years 7 months ago
Smooth sensitivity and sampling in private data analysis
We introduce a new, generic framework for private data analysis. The goal of private data analysis is to release aggregate information about a data set while protecting the privac...
Kobbi Nissim, Sofya Raskhodnikova, Adam Smith
ML
2006
ACM
15 years 6 months ago
Universal parameter optimisation in games based on SPSA
Most game programs have a large number of parameters that are crucial for their performance. While tuning these parameters by hand is rather difficult, efficient and easy to use ge...
Levente Kocsis, Csaba Szepesvári
DAC
2002
ACM
16 years 7 months ago
Timed compiled-code simulation of embedded software for performance analysis of SOC design
In this paper, a new timing generation method is proposed for the performance analysis of embedded software. The time stamp generation of I/O accesses is crucial to performance es...
Jong-Yeol Lee, In-Cheol Park
DM
2008
69views more  DM 2008»
15 years 6 months ago
New identities for 7-cores with prescribed BG-rank
Let be a partition. BG-rank() is defined as an alternating sum of parities of parts of [1]. In [2], Berkovich and Garvan found theta series representations for the t-core generat...
Alexander Berkovich, Hamza Yesilyurt