6833 search results - page 1221 / 1367 » Some two-character sets |
165
click to vote
STACS
2009
Springer
16 years 25 days ago
2009
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic-programming s...
162
click to vote
CIDM
2009
IEEE
16 years 25 days ago
2009
IEEE
—Some data mining problems require predictive models to be not only accurate but also comprehensible. Comprehensibility enables human inspection and understanding of the model, m...
172
click to vote
CSE
2009
IEEE
16 years 25 days ago
2009
IEEE
—Mobile devices can produce continuous streams of data which are often specific to the person carrying them. We show that cell phone tracks from the MIT Reality dataset can be u...
163
click to vote
FOCS
2009
IEEE
16 years 25 days ago
2009
IEEE
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
156
click to vote
FOCS
2009
IEEE
16 years 25 days ago
2009
IEEE
Abstract— We show how to efficiently extract truly random bits from two independent sources of linear min-entropy, under a computational assumption. The assumption we rely on is...