6517 search results - page 1178 / 1304 » On optimal service selection |
298
click to vote
VLDB
2007
ACM
16 years 7 months ago
2007
ACM
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
203
click to vote
SIGMOD
2002
ACM
16 years 7 months ago
2002
ACM
Recent work has demonstrated the effectiveness of the wavelet decomposition in reducing large amounts of data to compact sets of wavelet coefficients (termed "wavelet synopse...
142
click to vote
DCC
2006
IEEE
16 years 6 months ago
2006
IEEE
Abstract. We propose measures for compressed data structures, in which space usage is measured in a data-aware manner. In particular, we consider the fundamental dictionary problem...
223
click to vote
SDM
2009
SIAM
16 years 4 months ago
2009
SIAM
Large amounts of remotely sensed data calls for data mining techniques to fully utilize their rich information content. In this paper, we study new means of discovery and summariz...
165
click to vote
ICCAD
2005
IEEE
16 years 3 months ago
2005
IEEE
— Although the LUT (look-up table) size of FPGAs has been optimized for general applications, complicated designs may contain a large number of cascaded LUTs between flip-flops...