Sciweavers

207 search results - page 22 / 42
» Run-Time Switching Between Total Order Algorithms
Sort
View
SODA
2003
ACM
167views Algorithms» more  SODA 2003»
14 years 7 days ago
Counting inversions in lists
In a recent paper, Ajtai et al. [1] give a streaming algorithm to count the number of inversions in a stream Ä ¾ Ñ Ò using two passes and Ç´¯ ½ ÔÒÐÓ Ò´ÐÓ Ñ·ÐÓ...
Anupam Gupta, Francis Zane
CSC
2006
14 years 8 days ago
A Hybrid Number Representation Scheme Based on Symmetric Level-Index Arithmetic
- Symmetric level-index arithmetic was introduced to overcome the problems of overflow and underflow in scientific computations. A hybrid SLI-FLP number system, together with some ...
Xunyang Shen, Peter Turner
DCC
2011
IEEE
13 years 5 months ago
Improving PPM Algorithm Using Dictionaries
—We propose a method to improve traditional character-based PPM text compression algorithms. Consider a text file as a sequence of alternating words and non-words, the basic ide...
Yichuan Hu, Jianzhong (Charlie) Zhang, Farooq Khan...
ICDE
2008
IEEE
395views Database» more  ICDE 2008»
15 years 10 months ago
PermJoin: An Efficient Algorithm for Producing Early Results in Multi-join Query Plans
This paper introduces an efficient algorithm for Producing Early Results in Multi-join query plans (PermJoin, for short). While most previous research focuses only on the case of ...
Justin J. Levandoski, Mohamed E. Khalefa, Mohamed ...
TREC
2004
14 years 7 days ago
Juru at TREC 2004: Experiments with Prediction of Query Difficulty
Our experiments in the Robust track this year focused on predicting query difficulty and using this prediction for improving information retrieval. We developed two prediction alg...
Elad Yom-Tov, Shai Fine, David Carmel, Adam Darlow...