180 search results - page 7 / 36 » Universal Sequencing on a Single Machine |
109
click to vote
ICPR
2010
IEEE
15 years 5 months ago
2010
IEEE
In this paper, we present a method that recognizes single or multiple common actions between a pair of video sequences. We establish an energy function that evaluates geometric and...
DISOPT
2008
14 years 10 months ago
2008
We study the problem of minimizing total latency in machine scheduling with deliveries, which is defined as follows. There is a set of n jobs to be processed by a single machine a...
DBPL
2007
Springer
15 years 4 months ago
2007
Springer
Data streams are modeled as infinite or finite sequences of data elements coming from an arbitrary but fixed universe. The universe can have various built-in functions and predi...
LCTRTS
2004
Springer
15 years 3 months ago
2004
Springer
Most modern compilers operate by applying a fixed, program-independent sequence of optimizations to all programs. Compiler writers choose a single “compilation sequence”, or ...
IJBC
2007
14 years 10 months ago
2007
A Chaitin Omega number is the halting probability of a universal prefix-free Turing machine. Every Omega number is simultaneously computably enumerable (the limit of a computable...