9871 search results - page 2 / 1975 » On the Structure of Low Sets |
ICCD
2004
IEEE
14 years 2 months ago
2004
IEEE
This paper proposes a power-aware cache block allocation algorithm for the way-selective setassociative cache on embedded systems to reduce energy consumption without additional d...
LWA
2008
13 years 6 months ago
2008
We investigate the topical structure of the set of documents used to expand a query in pseudorelevance feedback (PRF). We propose a coherence score to measure the relative topical...
COCO
1989
Springer
13 years 9 months ago
1989
Springer
Kadin [6] showed that if the Polynomial Hierarchy (PH) has infinitely many levels, then for all k, PSAT[k] ⊂ PSAT[k+1]. This paper extends Kadin’s technique and shows that a p...
INFOCOM
2006
IEEE
13 years 11 months ago
2006
IEEE
— We design network topologies and routing strategies which optimize several measures simultaneously: low cost, small routing diameter , bounded degree and low congestion. This s...
TACAS
2007
Springer
13 years 11 months ago
2007
Springer
Reasoning about heap-allocated data structures such as linked lists and arrays is challenging. The reachability predicate has proved to be useful for reasoning about the heap in ty...