986 search results - page 65 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
128
click to vote
UAI
2003
15 years 4 months ago
2003
In this paper, we introduce a method for approximating the solution to inference and optimization tasks in uncertain and deterministic reasoning. Such tasks are in general intract...
130
Voted
STACS
2005
Springer
15 years 9 months ago
2005
Springer
The subset sum problem (SSP) (given n numbers and a target bound B, find a subset of the numbers summing to B), is one of the classical NP-hard problems. The hardness of SSP vari...
142
Voted
WADS
2005
Springer
15 years 9 months ago
2005
Springer
Spatial databases support a variety of geometric queries on point data such as range searches, nearest neighbor searches, etc. Balanced Aspect Ratio (BAR) trees are hierarchical sp...
143
Voted
APPROX
2011
Springer
14 years 3 months ago
2011
Springer
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...
138
Voted
INFOCOM
2012
IEEE
13 years 5 months ago
2012
IEEE
—We study error estimating codes with the goal of establishing better bounds for the theoretical and empirical overhead of such schemes. We explore the idea of using sketch data ...