304 search results - page 11 / 61 » Dynamic ordered sets with exponential search trees |
CIKM
2008
Springer
13 years 10 months ago
2008
Springer
We propose a dynamic faceted search system for discoverydriven analysis on data with both textual content and structured attributes. From a keyword query, we want to dynamically s...
HIPEAC
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. In this paper, we propose a novel approach to reduce dynamic power in set-associative caches that leverages on a leakage-saving proposal, namely Cache Decay. We thus open...
IDEAL
2007
Springer
14 years 2 months ago
2007
Springer
In the information age, online collaboration and social networks are of increasing importance and quickly becoming an integral part of our lifestyle. In business, social networking...
COR
2006
13 years 8 months ago
2006
Constraint programming uses enumeration and search tree pruning to solve combinatorial optimization problems. In order to speed up this solution process, we investigate the use of...
CPAIOR
2006
Springer
14 years 9 days ago
2006
Springer
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...