Sciweavers

83 search results - page 12 / 17
» Improving PPM Algorithm Using Dictionaries
Sort
View
STACS
2009
Springer
14 years 2 months ago
A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic-programming s...
Danny Hermelin, Gad M. Landau, Shir Landau, Oren W...
DEBU
2007
142views more  DEBU 2007»
13 years 7 months ago
Multi-lingual Indexing Support for CLIR using Language Modeling
An indexing model is the heart of an Information Retrieval (IR) system. Data structures such as term based inverted indices have proved to be very effective for IR using vector sp...
Prasad Pingali, Vasudeva Varma
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
13 years 11 months ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh
INFOCOM
2005
IEEE
14 years 29 days ago
Delayed-dictionary compression for packet networks
Abstract— This paper considers compression in packet networks. Since data packets may be dropped or arrive reordered, streaming compression algorithms result in a considerable de...
Yossi Matias, R. Refua
CI
2006
101views more  CI 2006»
13 years 7 months ago
Sentiment Classification of Movie Reviews Using Contextual Valence Shifters
We present two methods for determining the sentiment expressed by a movie review. The semantic orientation of a review can be positive, negative, or neutral. We examine the effect...
Alistair Kennedy, Diana Inkpen