3874 search results - page 247 / 775 » Approximation Algorithms for k-hurdle Problems |
135
click to vote
ICCAD
1993
IEEE
15 years 8 months ago
1993
IEEE
A new technique for design centering, and for polytope approximation of the feasible region for a design are presented. In the rst phase, the feasible region is approximated by a ...
141
click to vote
SDM
2003
SIAM
15 years 5 months ago
2003
SIAM
In earlier work we have introduced and explored a variety of different probabilistic models for the problem of answering selectivity queries posed to large sparse binary data set...
115
click to vote
KDD
2004
ACM
16 years 4 months ago
2004
ACM
The microeconomic framework for data mining [7] assumes that an enterprise chooses a decision maximizing the overall utility over all customers where the contribution of a custome...
117
click to vote
SIAMJO
2008
15 years 4 months ago
2008
We show that the optimal complexity of Nesterov's smooth first-order optimization algorithm is preserved when the gradient is only computed up to a small, uniformly bounded er...
117
click to vote
TALG
2008
15 years 4 months ago
2008
In this paper, we study the metrics of negative type, which are metrics (V, d) such that d is an Euclidean metric; these metrics are thus also known as " 2-squared" met...