197 search results - page 17 / 40 » Simple deterministic approximation algorithms for counting m... |
187
click to vote
ENTCS
2008
15 years 6 months ago
2008
In this paper, we introduce a system, written in Haskell, for filtering information from XML data. Essentially, the system implements a simple declarative language which allows on...
205
click to vote
MFCS
2005
Springer
15 years 11 months ago
2005
Springer
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...
146
click to vote
ECCV
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. In this paper we develop an algorithm for structured prediction that optimizes against complex performance measures, those which are a function of false positive and fals...
151
click to vote
SIGMETRICS
2006
ACM
15 years 11 months ago
2006
ACM
A major challenge in the design of wireless networks is the need for distributed scheduling algorithms that will efficiently share the common spectrum. Recently, a few distributed...
156
click to vote
DAM
2011
15 years 25 days ago
2011
We present a collection of new structural, algorithmic, and complexity results for two types of matching problems. The first problem involves the computation of k-maximal matchin...