Sciweavers

1322 search results - page 111 / 265
» Parameterized counting problems
Sort
View
ICASSP
2009
IEEE
14 years 3 months ago
Part-of-speech histograms for genre classification of text
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ï...
Sergey Feldman, Marius A. Marin, Mari Ostendorf, M...
ESA
2007
Springer
133views Algorithms» more  ESA 2007»
14 years 3 months ago
Order Statistics in the Farey Sequences in Sublinear Time
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...
Jakub Pawlewicz
CADE
1999
Springer
14 years 1 months ago
A PSpace Algorithm for Graded Modal Logic
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...
Stephan Tobies
CCCG
2008
13 years 10 months ago
Maximal Covering by Two Isothetic Unit Squares
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...
Priya Ranjan Sinha Mahapatra, Partha P. Goswami, S...
SAS
2004
Springer
132views Formal Methods» more  SAS 2004»
14 years 2 months ago
Modular and Constraint-Based Information Flow Inference for an Object-Oriented Language
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 ...
Qi Sun, Anindya Banerjee, David A. Naumann