297 search results - page 17 / 60 » Every Sequence Is Decompressible from a Random One |
JCT
2011
14 years 6 months ago
2011
The standard paradigm for online power of two choices problems in random graphs is the Achlioptas process. Here we consider the following natural generalization: Starting with G0 a...
JIB
2007
14 years 11 months ago
2007
As a multitude of sequence data are published, discovering polymorphisms bioinformatically becomes a valid option. In silico Single Nucleotide Polymorphism (SNP) detection is base...
PLDI
2004
ACM
15 years 4 months ago
2004
ACM
It has long been known that a fixed ordering of optimization phases will not produce the best code for every application. One approach for addressing this phase ordering problem ...
102
click to vote
CVPR
2007
IEEE
16 years 1 months ago
2007
IEEE
We describe a probabilistic framework for recognizing human activities in monocular video based on simple silhouette observations in this paper. The methodology combines kernel pr...
ICASSP
2011
IEEE
14 years 2 months ago
2011
IEEE
Discriminative tracking has become popular tracking methods due to their descriptive power for foreground/background separation. Among these methods, online random forest is recen...