1322 search results - page 111 / 265 » Parameterized counting problems |
111
Voted
ICASSP
2009
IEEE
15 years 9 months ago
2009
IEEE
This work addresses the problem of classifying the genre of text, which is useful for a variety of language processing problems. We propose statistics of POS histograms as classiï...
100
Voted
ESA
2007
Springer
15 years 9 months ago
2007
Springer
We present the rst sublinear-time algorithms for computing order statistics in the Farey sequence and for the related problem of ranking. Our algorithms achieve a running times o...
137
Voted
CADE
1999
Springer
15 years 7 months ago
1999
Springer
We present a PSpace algorithm that decides satisï¬ability of the graded modal logic Gr(KR)—a natural extension of propositional modal logic KR by counting expressions—which pl...
108
Voted
CCCG
2008
15 years 4 months ago
2008
Let P be the point set in two dimensional plane. In this paper, we consider the problem of locating two isothetic unit squares such that together they cover maximum number of poin...
127
Voted
SAS
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. This paper addresses the problem of checking programs written in an object-oriented language to ensure that they satisfy the information flow policies, conï¬dentiality ...