3341 search results - page 206 / 669 » On Bounded Queries and Approximation |
151
click to vote
PAKDD
2010
ACM
15 years 9 months ago
2010
ACM
We present a general framework for the task of extracting specific information “on demand” from a large corpus such as the Web under resource-constraints. Given a database wit...
166
click to vote
STOC
2006
ACM
16 years 6 months ago
2006
ACM
Gowers [Gow98, Gow01] introduced, for d 1, the notion of dimension-d uniformity Ud (f) of a function f : G C, where G is a finite abelian group. Roughly speaking, if a function ...
181
click to vote
SLSFS
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Mutual Information (MI) is a long studied measure of information content, and many attempts to apply it to feature extraction and stochastic coding have been made. Howeve...
150
click to vote
COLT
2005
Springer
15 years 11 months ago
2005
Springer
We consider the problem of learning a hypergraph using edge-detecting queries. In this model, the learner may query whether a set of vertices induces an edge of the hidden hypergr...
161
click to vote
FTDB
2011
14 years 9 months ago
2011
We present a survey of the various families of approaches to secure aggregation in distributed networks such as sensor networks. In our survey, we focus on the important algorithm...