432 search results - page 2 / 87 » Open Problems with Part-Whole Relations |
WCC
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. The recently developed algebraic attacks apply to all keystream generators whose internal state is updated by a linear transition function, including LFSR-based generator...
MST
2010
13 years 12 hour ago
2010
Cluster Editing is transforming a graph by at most k edge insertions or deletions into a disjoint union of cliques. This problem is fixed-parameter tractable (FPT). Here we comput...
COMSUR
2011
12 years 5 months ago
2011
—This survey guides the reader through the extensive open literature that is covering the family of low-density paritycheck (LDPC) codes and their rateless relatives. In doing so...
ACL
2009
13 years 3 months ago
2009
We define the problem of recognizing entailed relations
ESA
2009
Springer
13 years 11 months ago
2009
Springer
The purpose of this brief note is to describe recent work in the area of cuckoo hashing, including a clear description of several open problems, with the hope of spurring further r...