Sciweavers

4066 search results - page 12 / 814
» Improved Algorithms and Analysis for Secretary Problems and ...
Sort
View
ICDT
2007
ACM
107views Database» more  ICDT 2007»
14 years 1 months ago
Some Algorithmic Improvements for the Containment Problem of Conjunctive Queries with Negation
Query containment is a fundamental problem of databases. Given two queries q1 and q2, it asks whether the set of answers to q1 is included in the set of answers to q2 for any datab...
Michel Leclère, Marie-Laure Mugnier
SIGIR
2008
ACM
13 years 7 months ago
Exploiting subjectivity analysis in blogs to improve political leaning categorization
In this paper, we address a relatively new and interesting text categorization problem: classify a political blog as either liberal or conservative, based on its political leaning...
Maojin Jiang, Shlomo Argamon
IACR
2011
91views more  IACR 2011»
12 years 7 months ago
Improved Generalized Birthday Attack
Let r, B and w be positive integers. Let C be a linear code of length Bw and subspace of Fr 2. The k-regular-decoding problem is to find a nonzero codeword consisting of w length...
Paul Kirchner
CICLING
2010
Springer
13 years 10 months ago
A General Bio-inspired Method to Improve the Short-Text Clustering Task
"Short-text clustering" is a very important research field due to the current tendency for people to use very short documents, e.g. blogs, text-messaging and others. In s...
Diego Ingaramo, Marcelo Errecalde, Paolo Rosso
ICC
2007
IEEE
121views Communications» more  ICC 2007»
14 years 1 months ago
On the Expected Complexity Analysis of a Generalized Sphere Decoding Algorithm for Underdetermined Linear Communication Systems
This paper presents an analytical approach to evaluate the expected complexity of a generalized sphere decoding (GSD) algorithm, GSDλ − , for underdetermined integer leastsquare...
Ping Wang, Tho Le-Ngoc