8431 search results - page 1537 / 1687 » Algorithmically Independent Sequences |
114
Voted
ACMMSP
2004
ACM
15 years 8 months ago
2004
ACM
Instruction combining is an optimization to replace a sequence of instructions with a more efficient instruction yielding the same result in a fewer machine cycles. When we use it...
115
click to vote
NOSSDAV
2004
Springer
15 years 7 months ago
2004
Springer
Despite many years of research, fair queuing still faces a number of implementation challenges in high speed routers. In particular, in spite of proposals such as DiffServ, the st...
129
click to vote
MICRO
2003
IEEE
15 years 7 months ago
2003
IEEE
A dynamic optimizer is a runtime software system that groups a program’s instruction sequences into traces, optimizes those traces, stores the optimized traces in a softwarebase...
141
click to vote
MM
2003
ACM
15 years 7 months ago
2003
ACM
In this paper, we propose an approach that retrieves motion of objects from the videos based on the dynamic time warping of view invariant characteristics. The motion is represent...
118
click to vote
FUN
2010
Springer
15 years 7 months ago
2010
Springer
In the classic Josephus problem, elements 1, 2, . . . , n are placed in order around a circle and a skip value k is chosen. The problem proceeds in n rounds, where each round consi...