1332 search results - page 21 / 267 » An Efficient Algorithm for the Approximate Median Selection ... |
ESA
2010
Springer
13 years 9 months ago
2010
Springer
We consider parameterized convex optimization problems over the unit simplex, that depend on one parameter. We provide a simple and efficient scheme for maintaining an -approximat...
STOC
2006
ACM
14 years 8 months ago
2006
ACM
Many approximation algorithms have been presented in the last decades for hard search problems. The focus of this paper is on cryptographic applications, where it is desired to de...
IPCO
2008
13 years 10 months ago
2008
Given a set Q of squares with positive pro ts, the square packing problem is to select and pack a subset of squares of maximum pro t into a rectangular bin R. We present a polynomi...
PODS
2003
ACM
14 years 8 months ago
2003
ACM
We consider the view selection problem for XML content based routing: given a network, in which a stream of XML documents is routed and the routing decisions are taken based on re...
ECAI
2010
Springer
13 years 5 months ago
2010
Springer
The proposed feature selection method aims to find a minimum subset of the most informative variables for classification/regression by efficiently approximating the Markov Blanket ...