Sciweavers

1772 search results - page 52 / 355
» Classifying Problems into Complexity Classes
Sort
View
CSR
2007
Springer
14 years 4 months ago
On the Complexity of Matrix Rank and Rigidity
We revisit a well studied linear algebraic problem, computing the rank and determinant of matrices, in order to obtain completeness results for small complexity classes. In partic...
Meena Mahajan, Jayalal M. N. Sarma
LPAR
2007
Springer
14 years 4 months ago
The Complexity of Temporal Logic with Until and Since over Ordinals
Abstract. We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic thanks to ...
Stéphane Demri, Alexander Rabinovich
TOCL
2008
102views more  TOCL 2008»
13 years 10 months ago
Flat and one-variable clauses: Complexity of verifying cryptographic protocols with single blind copying
Cryptographic protocols with single blind copying were defined and modeled by Comon and Cortier using the new class C of first order clauses, which extends the Skolem class. They s...
Helmut Seidl, Kumar Neeraj Verma
KDD
2009
ACM
170views Data Mining» more  KDD 2009»
14 years 10 months ago
Genre-based decomposition of email class noise
Corruption of data by class-label noise is an important practical concern impacting many classification problems. Studies of data cleaning techniques often assume a uniform label ...
Aleksander Kolcz, Gordon V. Cormack
CIKM
2008
Springer
14 years 1 days ago
Identification of class specific discourse patterns
In this paper we address the problem of extracting important (and unimportant) discourse patterns from call center conversations. Call centers provide dialog based calling-in supp...
Anup Chalamalla, Sumit Negi, L. Venkata Subramania...