5964 search results - page 873 / 1193 » A theory of speculative computation |
162
click to vote
KDD
2004
ACM
16 years 7 months ago
2004
ACM
Most data mining algorithms require the setting of many input parameters. Two main dangers of working with parameter-laden algorithms are the following. First, incorrect settings ...
320
click to vote
POPL
2006
ACM
16 years 7 months ago
2006
ACM
Noninterference is the basic semantical condition used to account for confidentiality and integrity-related properties in programming languages. There appears to be an at least im...
197
click to vote
STOC
2004
ACM
16 years 7 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...
189
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
198
click to vote
PODS
2006
ACM
16 years 7 months ago
2006
ACM
Finding icebergs ? items whose frequency of occurrence is above a certain threshold ? is an important problem with a wide range of applications. Most of the existing work focuses ...