Parameterised compression for sparse bitmaps
SIGIR '92 Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval
Detecting content-bearing words by serial clustering—extended abstract
SIGIR '95 Proceedings of the 18th annual international ACM SIGIR conference on Research and development in information retrieval
Approximating shallow-light trees
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Binary Interpolative Coding for Effective Index Compression
Information Retrieval
Information Retrieval
Fuzzy Hamming Distance: A New Dissimilarity Measure
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
A General Approach to Compression of Hierarchical Indexes
DEXA '01 Proceedings of the 12th International Conference on Database and Expert Systems Applications
The Link Database: Fast Access to Graphs of the Web
DCC '02 Proceedings of the Data Compression Conference
Proceedings of the 2003 ACM symposium on Applied computing
Inverted files for text search engines
ACM Computing Surveys (CSUR)
Proceedings of the 8th annual conference on Genetic and evolutionary computation
On the bounded-hop MST problem on random Euclidean instances
Theoretical Computer Science
LS(graph & tree): a local search framework for constraint optimization on graphs and trees
Proceedings of the 2009 ACM symposium on Applied Computing
A bounded diameter minimum spanning tree evolutionaryalgorithm based on double chromosome
Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Novel Deterministic Heuristics for Building Minimum Spanning Trees with Constrained Diameter
PReMI '09 Proceedings of the 3rd International Conference on Pattern Recognition and Machine Intelligence
Compression algorithms for structural query results on XML data
WAIM'10 Proceedings of the 2010 international conference on Web-age information management
Improvement of bounded-diameter MST instances with hybridization of multi-objective EA
Proceedings of the 2011 International Conference on Communication, Computing & Security
Divide and conquer is almost optimal for the bounded-hop MST problem on random euclidean instances
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
| Hi-index | 0.00 |