Sciweavers

229 search results - page 36 / 46
» Speeding Up Two String-Matching Algorithms
Sort
View
CIKM
2010
Springer
13 years 6 months ago
Fast query expansion using approximations of relevance models
Pseudo-relevance feedback (PRF) improves search quality by expanding the query using terms from high-ranking documents from an initial retrieval. Although PRF can often result in ...
Marc-Allen Cartright, James Allan, Victor Lavrenko...
TIP
2011
124views more  TIP 2011»
13 years 2 months ago
A Geometric Method for Optimal Design of Color Filter Arrays
—A color filter array (CFA) used in a digital camera is a mosaic of spectrally selective filters, which allows only one color component to be sensed at each pixel. The missing ...
Pengwei Hao, Yan Li, Zhouchen Lin, Eric Dubois
DASFAA
2011
IEEE
250views Database» more  DASFAA 2011»
12 years 11 months ago
An FTL-Agnostic Layer to Improve Random Write on Flash Memory
Flash memories are considered a competitive alternative to rotating disks as non-volatile data storage for database management systems. However, even if the Flash Translation Layer...
Brice Chardin, Olivier Pasteur, Jean-Marc Petit
EUROSYS
2011
ACM
12 years 11 months ago
Scarlett: coping with skewed content popularity in mapreduce clusters
To improve data availability and resilience MapReduce frameworks use file systems that replicate data uniformly. However, analysis of job logs from a large production cluster show...
Ganesh Ananthanarayanan, Sameer Agarwal, Srikanth ...
KDD
2012
ACM
221views Data Mining» more  KDD 2012»
11 years 10 months ago
Fast mining and forecasting of complex time-stamped events
Given huge collections of time-evolving events such as web-click logs, which consist of multiple attributes (e.g., URL, userID, timestamp), how do we find patterns and trends? Ho...
Yasuko Matsubara, Yasushi Sakurai, Christos Falout...