1469 search results - page 108 / 294 » Approximate polynomial decomposition |
ECRTS
2004
IEEE
15 years 1 months ago
2004
IEEE
This paper presents a new approach to understand the event stream model. Additionally a new approximation algorithm for the feasibility test of the sporadic and the generalized mu...
DAM
2006
14 years 10 months ago
2006
Subtree filament graphs are the intersection graphs of subtree filaments in a tree. This class of graphs contains subtree overlap graphs, interval filament graphs, chordal graphs,...
SIAMDM
2000
14 years 9 months ago
2000
Abstract. We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation...
116
click to vote
MLDM
2010
Springer
14 years 4 months ago
2010
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...
CVPR
2004
IEEE
15 years 12 months ago
2004
IEEE
Given a set of patterns and a similarity measure between them, we will present an optimization framework to approximate a small subset, known as a canonical set, whose members clo...