Sciweavers

5608 search results - page 1056 / 1122
» On the Theory of Matchgate Computations
Sort
View
WWW
2002
ACM
16 years 2 months ago
Clustering for opportunistic communication
We describe ongoing work on I2I, a system aimed at fostering opportunistic communication among users viewing or manipulating content on the Web and in productivity applications. U...
Jay Budzik, Shannon Bradshaw, Xiaobin Fu, Kristian...
STOC
2009
ACM
159views Algorithms» more  STOC 2009»
16 years 2 months ago
Message passing algorithms and improved LP decoding
Linear programming decoding for low-density parity check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its p...
Sanjeev Arora, Constantinos Daskalakis, David Steu...
140
Voted
STOC
2009
ACM
163views Algorithms» more  STOC 2009»
16 years 2 months ago
Non-monotone submodular maximization under matroid and knapsack constraints
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, M...
102
Voted
KDD
2009
ACM
174views Data Mining» more  KDD 2009»
16 years 2 months ago
Audience selection for on-line brand advertising: privacy-friendly social network targeting
This paper describes and evaluates privacy-friendly methods for extracting quasi-social networks from browser behavior on user-generated content sites, for the purpose of finding ...
Foster J. Provost, Brian Dalessandro, Rod Hook, Xi...
KDD
2009
ACM
239views Data Mining» more  KDD 2009»
16 years 2 months ago
Tell me something I don't know: randomization strategies for iterative data mining
There is a wide variety of data mining methods available, and it is generally useful in exploratory data analysis to use many different methods for the same dataset. This, however...
Heikki Mannila, Kai Puolamäki, Markus Ojala, ...
« Prev « First page 1056 / 1122 Last » Next »