Sciweavers

221 search results - page 17 / 45
» Efficient sampling of random permutations
Sort
View
NLP
2000
13 years 11 months ago
Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
Jean-Cédric Chappelier, Martin Rajman
IEEEPACT
2005
IEEE
14 years 1 months ago
Trace Cache Sampling Filter
This paper presents a new technique for efficient usage of small trace caches. A trace cache can significantly increase the performance of wide out-oforder processors, but to be e...
Michael Behar, Avi Mendelson, Avinoam Kolodny
ICDE
2008
IEEE
130views Database» more  ICDE 2008»
14 years 9 months ago
A Sampling-Based Approach to Information Recovery
There has been a recent resurgence of interest in research on noisy and incomplete data. Many applications require information to be recovered from such data. For example, in sens...
Junyi Xie, Jun Yang 0001, Yuguo Chen, Haixun Wang,...
KDD
2008
ACM
178views Data Mining» more  KDD 2008»
14 years 8 months ago
Training structural svms with kernels using sampled cuts
Discriminative training for structured outputs has found increasing applications in areas such as natural language processing, bioinformatics, information retrieval, and computer ...
Chun-Nam John Yu, Thorsten Joachims
STOC
2007
ACM
112views Algorithms» more  STOC 2007»
14 years 8 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