453 search results - page 48 / 91 » Tight bounds for the partial-sums problem |
90
Voted
BILDMED
2007
15 years 2 months ago
2007
Abstract. Volume representations of blood vessels acquired by 3D rotational angiography are very suitable for diagnosing an aneurysm. We presented a fully-automatic aneurysm labell...
106
Voted
ICCAD
2003
IEEE
15 years 9 months ago
2003
IEEE
– Many embedded system designs usually impose (hard) read-time constraints on tasks. Thus, computing a tight upper bound of the worst case execution time (WCET) of a software is ...
84
Voted
ICCAD
2003
IEEE
15 years 9 months ago
2003
IEEE
As the clock frequencies used in industrial applications increase, the timing requirements imposed on routing problems become tighter. So, it becomes important to route the nets w...
113
Voted
BMCBI
2011
14 years 7 months ago
2011
Background: Multiclass classification of microarray data samples with a reduced number of genes is a rich and challenging problem in Bioinformatics research. The problem gets hard...
123
click to vote
LATA
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Motivated by strong Karp-Lipton collapse results in bounded arithmetic, Cook and Kraj´ıˇcek [7] have recently introduced the notion of propositional proof systems with...