Sciweavers

7228 search results - page 29 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
SIGSOFT
2008
ACM
15 years 10 months ago
Deriving input syntactic structure from execution
Program input syntactic structure is essential for a wide range of applications such as test case generation, software debugging and network security. However, such important info...
Zhiqiang Lin, Xiangyu Zhang
KDD
2007
ACM
192views Data Mining» more  KDD 2007»
15 years 10 months ago
Active exploration for learning rankings from clickthrough data
We address the task of learning rankings of documents from search engine logs of user behavior. Previous work on this problem has relied on passively collected clickthrough data. ...
Filip Radlinski, Thorsten Joachims
STOC
1993
ACM
117views Algorithms» more  STOC 1993»
15 years 1 months ago
Efficient noise-tolerant learning from statistical queries
In this paper, we study the problem of learning in the presence of classification noise in the probabilistic learning model of Valiant and its variants. In order to identify the cl...
Michael J. Kearns
ICASSP
2010
IEEE
14 years 10 months ago
Reconstruction of sparse signals from distorted randomized measurements
In this paper we show that, surprisingly, it is possible to recover sparse signals from nonlinearly distorted measurements, even if the nonlinearity is unknown. Assuming just that...
Petros Boufounos
79
Voted
ICDCS
2007
IEEE
15 years 4 months ago
Uniform Data Sampling from a Peer-to-Peer Network
Uniform random sample is often useful in analyzing data. Usually taking a uniform sample is not a problem if the entire data resides in one location. However, if the data is distr...
Souptik Datta, Hillol Kargupta