516 search results - page 42 / 104 » Sets of k-Independent Strings |
TSMC
2008
13 years 8 months ago
2008
Given a genome, i.e., a long string over a fixed finite alphabet, the problem is to find short (dis)similar substrings. This computationally intensive task has many biological appl...
TNN
1998
13 years 8 months ago
1998
—Recurrent neural networks processing symbolic strings can be regarded as adaptive neural parsers. Given a set of positive and negative examples, picked up from a given language,...
ICDCN
2011
Springer
13 years 7 days ago
2011
Springer
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the ...
IACR
2011
12 years 8 months ago
2011
Fully homomorphic encryption (FHE) provides a simple template for secure computation between two parties (Alice and Bob) where: (I) Alice encrypts her input under her key, (II) Bo...
SIGMOD
2010
ACM
14 years 1 months ago
2010
ACM
We investigate the problem of creating and analyzing samples of relational databases to find relationships between string-valued attributes. Our focus is on identifying attribute...