988 search results - page 182 / 198 » Positive Results and Techniques for Obfuscation |
SODA
2012
ACM
11 years 11 months ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
RECOMB
2004
Springer
14 years 9 months ago
2004
Springer
Phylogenetic hidden Markov models (phylo-HMMs) have recently been proposed as a means for addressing a multispecies version of the ab initio gene prediction problem. These models ...
ICALP
2009
Springer
14 years 9 months ago
2009
Springer
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
SIGMOD
2005
ACM
14 years 9 months ago
2005
ACM
In this paper, we study the evaluation of skyline queries with partially-ordered attributes. Because such attributes lack a total ordering, traditional index-based evaluation algo...
CHI
2010
ACM
14 years 3 months ago
2010
ACM
Many tasks require attention switching. For example, searching for information on one sheet of paper and then entering this information onto another one. With paper we see that pe...