Sciweavers

3604 search results - page 594 / 721
» All Common Subsequences
Sort
View
WSDM
2010
ACM
322views Data Mining» more  WSDM 2010»
16 years 1 months ago
Inferring Search Behaviors Using Partially Observable Markov (POM) Model
This article describes an application of the partially observable Markov (POM) model to the analysis of a large scale commercial web search log. Mathematically, POM is a variant o...
Kuansan Wang, Nikolas Gloy, Xiaolong Li
SODA
2010
ACM
215views Algorithms» more  SODA 2010»
16 years 1 months ago
Compact Ancestry Labeling Schemes for XML Trees
An ancestry labeling scheme labels the nodes of any tree in such a way that ancestry queries between any two nodes can be answered just by looking at their corresponding labels. T...
Fraigniaud Pierre, Korman Amos
PPOPP
2010
ACM
16 years 1 months ago
Scalable communication protocols for dynamic sparse data exchange
Many large-scale parallel programs follow a bulk synchronous parallel (BSP) structure with distinct computation and communication phases. Although the communication phase in such ...
Torsten Hoefler, Christian Siebert, Andrew Lumsdai...
ICDCS
2009
IEEE
16 years 1 months ago
File Versioning for Block-Level Continuous Data Protection
Block-level continuous data protection (CDP) logs every disk block update so that disk updates within a time window are undoable. Standard file servers and DBMS servers can enjoy...
Maohua Lu, Tzi-cker Chiueh
EUROSYS
2007
ACM
16 years 1 months ago
Competitive prefetching for concurrent sequential I/O
During concurrent I/O workloads, sequential access to one I/O stream can be interrupted by accesses to other streams in the system. Frequent switching between multiple sequential ...
Chuanpeng Li, Kai Shen, Athanasios E. Papathanasio...