Sciweavers

10392 search results - page 1988 / 2079
» Introduction to Computer Science
Sort
View
121
Voted
KDD
2004
ACM
210views Data Mining» more  KDD 2004»
16 years 27 days ago
Probabilistic author-topic models for information discovery
We propose a new unsupervised learning technique for extracting information from large text collections. We model documents as if they were generated by a two-stage stochastic pro...
Mark Steyvers, Padhraic Smyth, Michal Rosen-Zvi, T...
98
Voted
KDD
2003
ACM
99views Data Mining» more  KDD 2003»
16 years 27 days ago
Fragments of order
High-dimensional collections of 0-1 data occur in many applications. The attributes in such data sets are typically considered to be unordered. However, in many cases there is a n...
Aristides Gionis, Teija Kujala, Heikki Mannila
VLSID
2007
IEEE
210views VLSI» more  VLSID 2007»
16 years 26 days ago
Dynamically Optimizing FPGA Applications by Monitoring Temperature and Workloads
In the past, Field Programmable Gate Array (FPGA) circuits only contained a limited amount of logic and operated at a low frequency. Few applications running on FPGAs consumed exc...
Phillip H. Jones, Young H. Cho, John W. Lockwood
STOC
2007
ACM
112views Algorithms» more  STOC 2007»
16 years 24 days 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
STOC
2004
ACM
157views Algorithms» more  STOC 2004»
16 years 24 days ago
Derandomizing homomorphism testing in general groups
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
Amir Shpilka, Avi Wigderson
« Prev « First page 1988 / 2079 Last » Next »