Sciweavers

27 search results - page 5 / 6
» A Simple Algorithm for Stable Minimum Storage Merging
Sort
View
DEBU
2010
128views more  DEBU 2010»
13 years 3 months ago
Designing Database Operators for Flash-enabled Memory Hierarchies
Flash memory affects not only storage options but also query processing. In this paper, we analyze the use of flash memory for database query processing, including algorithms that...
Goetz Graefe, Stavros Harizopoulos, Harumi A. Kuno...
SIGIR
2011
ACM
12 years 9 months ago
Faster temporal range queries over versioned text
Versioned textual collections are collections that retain multiple versions of a document as it evolves over time. Important large-scale examples are Wikipedia and the web collect...
Jinru He, Torsten Suel
SIGIR
2010
ACM
13 years 6 months ago
Optimal meta search results clustering
By analogy with merging documents rankings, the outputs from multiple search results clustering algorithms can be combined into a single output. In this paper we study the feasibi...
Claudio Carpineto, Giovanni Romano
GECCO
2003
Springer
112views Optimization» more  GECCO 2003»
13 years 11 months ago
Limits in Long Path Learning with XCS
The development of the XCS Learning Classifier System [26] has produced a stable implementation, able to consistently identify the accurate and optimally general population of cla...
Alwyn Barry
INFOCOM
2009
IEEE
14 years 27 days ago
Distilling Superior Peers in Large-Scale P2P Streaming Systems
Abstract—In large-scale peer-to-peer (P2P) live streaming systems with a limited supply of server bandwidth, increasing the amount of upload bandwidth supplied by peers becomes c...
Zimu Liu, Chuan Wu, Baochun Li, Shuqiao Zhao