3341 search results - page 324 / 669 » On Bounded Queries and Approximation |
209
Voted
AMT
2006
Springer
15 years 9 months ago
2006
Springer
As the first stage for discovering association rules, frequent itemsets mining is an important challenging task for large databases. Sampling provides an efficient way to get appro...
187
click to vote
COCOON
2005
Springer
16 years 1 months ago
2005
Springer
We study the worst-case performance of the maximal matching heuristic applied to the Minimum Vertex Cover and Minimum Maximal Matching problems, through a careful analysis of tigh...
170
Voted
RANDOM
2001
Springer
16 years 17 hour ago
2001
Springer
We discuss two approximation approaches, the primal-dual schema and the local-ratio technique. We present two relatively simple frameworks, one for each approach, which extend know...
172
Voted
RANDOM
2001
Springer
16 years 17 hour ago
2001
Springer
We study Euclidean embeddings of Euclidean metrics and present the following four results: (1) an O(log3 n √ log log n) approximation for minimum bandwidth in conjunction with a ...
208
click to vote
DATE
1999
IEEE
15 years 12 months ago
1999
IEEE
Methods for performing component matching by expressing an arithmetic specification and a bit-level description of an implementation as word-level polynomials have been demonstrat...