Sciweavers

8 search results - page 1 / 2
» An extremal problem on the potentially Pk-graphic sequences
Sort
View
40
Voted
DM
2000
69views more  DM 2000»
14 years 9 months ago
An extremal problem on the potentially Pk-graphic sequences
Jiong-Sheng Li, Zi-Xia Song
GECCO
2007
Springer
211views Optimization» more  GECCO 2007»
15 years 3 months ago
An extremal optimization search method for the protein folding problem: the go-model example
The protein folding problem consists of predicting the functional (native) structure of the protein given its linear sequence of amino acids. Despite extensive progress made in un...
Alena Shmygelska
94
Voted
PLDI
2004
ACM
15 years 3 months ago
Fast searches for effective optimization phase sequences
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 ...
Prasad Kulkarni, Stephen Hines, Jason Hiser, David...
CVPR
2007
IEEE
15 years 11 months ago
From Videos to Verbs: Mining Videos for Activities using a Cascade of Dynamical Systems
Clustering video sequences in order to infer and extract activities from a single video stream is an extremely important problem and has significant potential in video indexing, s...
Pavan K. Turaga, Ashok Veeraraghavan, Rama Chellap...
66
Voted
CPM
2006
Springer
95views Combinatorics» more  CPM 2006»
15 years 1 months ago
New Bounds for Motif Finding in Strong Instances
Many algorithms for motif finding that are commonly used in bioinformatics start by sampling r potential motif occurrences from n input sequences. The motif is derived from these s...
Brona Brejová, Daniel G. Brown, Ian M. Harr...