3341 search results - page 357 / 669 » On Bounded Queries and Approximation |
147
click to vote
MOR
2002
15 years 6 months ago
2002
Semidefinite feasibility problems arise in many areas of operations research. The abstract form of these problems can be described as finding a point in a nonempty bounded convex b...
175
click to vote
TCS
2002
15 years 6 months ago
2002
We discuss several complexity measures for Boolean functions: certi cate complexity, sensitivity, block sensitivity, and the degree of a representing or approximating polynomial. ...
195
click to vote
SIAMJO
2010
15 years 1 months ago
2010
We study the problem of minimizing the expected loss of a linear predictor while constraining its sparsity, i.e., bounding the number of features used by the predictor. While the r...
259
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
In this demonstration, we present a prototype content-based dissemination broker, called Sonnet, which is built upon structured overlay network. It combines approximate filtering ...
156
click to vote
SSDBM
2000
IEEE
15 years 11 months ago
2000
IEEE
Efficient evaluation of spatial join is an important issue in spatial databases. The traditional evaluation strategy is to perform a join of “minimum bounding rectangles” (mbr...