9520 search results - page 1579 / 1904 » or 2011 |
228
click to vote
ALT
2011
Springer
14 years 6 months ago
2011
Springer
We consider the problem of learning sparse parities in the presence of noise. For learning parities on r out of n variables, we give an algorithm that runs in time poly log 1 δ , ...
278
click to vote
AMAI
2011
Springer
14 years 6 months ago
2011
Springer
Formal concept analysis (FCA) has been applied successively in diverse fields such as data mining, conceptual modeling, social networks, software engineering, and the semantic we...
200
click to vote
APPROX
2011
Springer
14 years 6 months ago
2011
Springer
In a well-known result Goldreich and Trevisan (2003) showed that every testable graph property has a “canonical” tester in which a set of vertices is selected at random and the...
190
click to vote
APPROX
2011
Springer
14 years 6 months ago
2011
Springer
This work considers locally decodable codes in the computationally bounded channel model. The computationally bounded channel model, introduced by Lipton in 1994, views the channe...
262
click to vote
APVIS
2011
14 years 6 months ago
2011
NETSPEAK helps writers in choosing words while writing a text. It checks for the commonness of phrases and allows for the retrieval of alternatives by means of wildcard queries. T...