Sciweavers

514 search results - page 5 / 103
» Multiplicative structures in additively large sets
Sort
View
WWW
2005
ACM
14 years 8 months ago
Three-level caching for efficient query processing in large Web search engines
Large web search engines have to answer thousands of queries per second with interactive response times. Due to the sizes of the data sets involved, often in the range of multiple...
Xiaohui Long, Torsten Suel
TIP
2010
205views more  TIP 2010»
13 years 2 months ago
Variational Region-Based Segmentation Using Multiple Texture Statistics
This paper addresses variational supervised texture segmentation. The main contributions are twofold. First, the proposed method circumvents a major problem related to classical t...
Imen Karoui, Ronan Fablet, Jean-Marc Boucher, Jean...
BMCBI
2005
98views more  BMCBI 2005»
13 years 7 months ago
The effects of normalization on the correlation structure of microarray data
Background: Stochastic dependence between gene expression levels in microarray data is of critical importance for the methods of statistical inference that resort to pooling test-...
Xing Qiu, Andrew I. Brooks, Lev Klebanov, Andrei Y...
SIGMOD
2008
ACM
131views Database» more  SIGMOD 2008»
14 years 7 months ago
Discovering topical structures of databases
The increasing complexity of enterprise databases and the prevalent lack of documentation incur significant cost in both understanding and integrating the databases. Existing solu...
Wensheng Wu, Berthold Reinwald, Yannis Sismanis, R...
GLVLSI
2011
IEEE
351views VLSI» more  GLVLSI 2011»
12 years 11 months ago
Design of low-power multiple constant multiplications using low-complexity minimum depth operations
Existing optimization algorithms for the multiplierless realization of multiple constant multiplications (MCM) typically target the minimization of the number of addition and subt...
Levent Aksoy, Eduardo Costa, Paulo F. Flores, Jos&...