Sciweavers

174 search results - page 12 / 35
» A new objective function for sequence labeling
Sort
View
JCO
2007
100views more  JCO 2007»
14 years 9 months ago
Semi-online scheduling with "end of sequence" information
We study a variant of classical scheduling, which is called scheduling with “end of sequence” information. It is known in advance that the last job has the longest processing ...
Leah Epstein, Deshi Ye
JCT
2010
117views more  JCT 2010»
14 years 8 months ago
(2+2)-free posets, ascent sequences and pattern avoiding permutations
Abstract. We present bijections between four classes of combinatorial objects. Two of them, the class of unlabeled (2 + 2)-free posets and a certain class of involutions (or chord ...
Mireille Bousquet-Mélou, Anders Claesson, M...
PAMI
2007
125views more  PAMI 2007»
14 years 9 months ago
Matching by Linear Programming and Successive Convexification
—We present a novel convex programming scheme to solve matching problems, focusing on the challenging problem of matching in a large search range and with cluttered background. M...
Hao Jiang, Mark S. Drew, Ze-Nian Li
TCSV
2002
124views more  TCSV 2002»
14 years 9 months ago
Fast and automatic video object segmentation and tracking for content-based applications
The new video-coding standard MPEG-4 enables content-based functionality, as well as high coding efficiency, by taking into account shape information of moving objects. A novel alg...
Changick Kim, Jenq-Neng Hwang
CP
2003
Springer
15 years 3 months ago
A SAT-Based Approach to Multiple Sequence Alignment
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. T...
Steven David Prestwich, Desmond G. Higgins, Orla O...