650 search results - page 104 / 130 » Progressive simplicial complexes |
STOC
2004
ACM
15 years 10 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...
83
Voted
SIGMOD
2003
ACM
15 years 9 months ago
2003
ACM
A query optimizer compares alternative plans in its search space to find the best plan for a given query. Depending on the search space and the enumeration algorithm, optimizers v...
STACS
2010
Springer
15 years 4 months ago
2010
Springer
Kabanets and Impagliazzo [KI04] show how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit ...
83
Voted
PLDI
2009
ACM
15 years 4 months ago
2009
ACM
Transactional memory (TM) is an appealing abstraction for programming multi-core systems. Potential target applications for TM, such as business software and video games, are like...
89
Voted
CIKM
2009
Springer
15 years 4 months ago
2009
Springer
Background: Diagnosis techniques using urine are non-invasive, inexpensive, and easy to perform in clinical settings. The metabolites in urine, as the end products of cellular pro...