2745 search results - page 514 / 549 » A fast algorithm for computing large Fibonacci numbers |
277
Voted
ECCV
2004
Springer
16 years 5 months ago
2004
Springer
The problem of tracking a varying number of non-rigid objects has two major difficulties. First, the observation models and target distributions can be highly non-linear and non-Ga...
173
Voted
PODC
2006
ACM
15 years 9 months ago
2006
ACM
We present Grouped Distributed Queues (GDQ), the first proportional share scheduler for multiprocessor systems that scales well with a large number of processors and processes. G...
175
Voted
DAC
2010
ACM
15 years 7 months ago
2010
ACM
We present a methodology for off-chip memory bandwidth minimization through application-driven L2 cache partitioning in multicore systems. A major challenge with multi-core system...
135
Voted
SIGCOMM
2010
ACM
15 years 3 months ago
2010
ACM
Flow-based networks such as OpenFlow-based networks have difficulty handling a large number of flows in a node due to the capacity limitation of search engine devices such as tern...
140
Voted
BMCBI
2008
15 years 3 months ago
2008
Background: The identification of transcription factor binding sites is difficult since they are only a small number of nucleotides in size, resulting in large numbers of false po...