12519 search results - page 2280 / 2504 » Approximation Problems Categories |
141
click to vote
RECOMB
2004
Springer
16 years 5 months ago
2004
Springer
Finding recurring residue packing patterns, or spatial motifs, that characterize protein structural families is an important problem in bioinformatics. To this end, we apply a nov...
148
click to vote
STOC
2004
ACM
16 years 5 months ago
2004
ACM
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
138
click to vote
STOC
2003
ACM
16 years 5 months ago
2003
ACM
Improving an old result of Clarkson et al., we show that the number of distinct distances determined by a set P of n points in three-dimensional space is (n77/141) = (n0.546 ), fo...
242
click to vote
VLDB
2008
ACM
16 years 5 months ago
2008
ACM
The evolution of computing technology suggests that it has become more feasible to offer access to Web information in a ubiquitous way, through various kinds of interaction device...
268
click to vote
SIGMOD
2009
ACM
16 years 5 months ago
2009
ACM
Labeling schemes lie at the core of query processing for many XML database management systems. Designing labeling schemes for dynamic XML documents is an important problem that ha...