1740 search results - page 28 / 348 » Minimal structures for stories |
ICPR
2004
IEEE
14 years 11 months ago
2004
IEEE
In this article, we present an unsupervised segmentation algorithm through a multiresolution approach which uses both color and edge information with a quadtree structure, through...
WIA
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. Hopcroft’s algorithm for minimizing a deterministic automaton has complexity O(n log n). We show that this complexity bound is tight. More precisely, we provide a famil...
PPAM
2001
Springer
14 years 2 months ago
2001
Springer
Abstract. This paper investigates the complexity of scheduling biprocessor tasks on dedicated processors to minimize mean flow time. Since the general problem is strongly NP-hard,...
CF
2005
ACM
13 years 12 months ago
2005
ACM
Power consumption within the memory hierarchy grows in importance as on-chip data caches occupy increasingly greater die area. Among dynamic power conservation schemes, horizontal...
TC
2008
13 years 10 months ago
2008
This paper describes a new on-demand wake-up prediction policy for reducing leakage power. The key insight is that branch prediction can be used to selectively wake up only the nee...