7150 search results - page 72 / 1430 » An Approximation Algorithm for Approximation Rank |
156
click to vote
AAAI
2008
15 years 9 months ago
2008
Compilation is an important approach to a range of inference problems, since it enables linear-time inference in the size S of the compiled representation. However, the main drawb...
205
click to vote
ISAAC
2005
Springer
16 years 20 days ago
2005
Springer
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...
219
Voted
DEXA
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Sensor database is a type of database management system which offers sensor data and stored data in its data model and query languages. In this system, when a user poses ...
208
Voted
APPROX
2010
Springer
15 years 8 months ago
2010
Springer
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
183
click to vote
APPROX
2007
Springer
16 years 1 months ago
2007
Springer
A star graph is a tree of diameter at most two. A star forest is a graph that consists of node-disjoint star graphs. In the spanning star forest problem, given an unweighted graph ...