Sciweavers

1537 search results - page 248 / 308
» On sets not belonging to algebras
Sort
View
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
14 years 1 months ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek
SP
2010
IEEE
165views Security Privacy» more  SP 2010»
14 years 23 days ago
A Practical Attack to De-anonymize Social Network Users
—Social networking sites such as Facebook, LinkedIn, and Xing have been reporting exponential growth rates. These sites have millions of registered users, and they are interestin...
Gilbert Wondracek, Thorsten Holz, Engin Kirda, Chr...
CPM
2005
Springer
100views Combinatorics» more  CPM 2005»
13 years 11 months ago
Hardness of Optimal Spaced Seed Design
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
François Nicolas, Eric Rivals
SDM
2008
SIAM
125views Data Mining» more  SDM 2008»
13 years 10 months ago
Mining and Ranking Generators of Sequential Patterns
Sequential pattern mining first proposed by Agrawal and Srikant has received intensive research due to its wide range applicability in many real-life domains. Various improvements...
David Lo, Siau-Cheng Khoo, Jinyan Li
BIRTHDAY
2010
Springer
13 years 10 months ago
Choiceless Computation and Symmetry
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
Benjamin Rossman