Sciweavers

2656 search results - page 99 / 532
» Compacting XML Data
Sort
View
CIKM
2001
Springer
15 years 9 months ago
X007: Applying 007 Benchmark to XML Query Processing Tool
If XML is to play the critical role of the lingua franca for Internet data interchange that many predict, it is necessary to start designing and adopting benchmarks allowing the c...
Stéphane Bressan, Gillian Dobbie, Zoé...
ISPA
2005
Springer
15 years 10 months ago
COMPACT: A Comparative Package for Clustering Assessment
Abstract. There exist numerous algorithms that cluster data-points from largescale genomic experiments such as sequencing, gene-expression and proteomics. Such algorithms may emplo...
Roy Varshavsky, Michal Linial, David Horn
CVPR
2011
IEEE
14 years 8 months ago
Compact Hashing with Joint Optimization of Search Accuracy and Time
Similarity search, namely, finding approximate nearest neighborhoods, is the core of many large scale machine learning or vision applications. Recently, many research results dem...
Junfeng He, Regunathan Radhakrishnan, Shih-Fu Chan...
CSDA
2007
115views more  CSDA 2007»
15 years 5 months ago
Algorithms for compact letter displays: Comparison and evaluation
Multiple pairwise comparisons are one of the most frequent tasks in applied statistics. In this context, letter displays may be used for a compact presentation of results of multi...
Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Nie...
117
Voted
CPM
2004
Springer
87views Combinatorics» more  CPM 2004»
15 years 10 months ago
A Trie-Based Approach for Compacting Automata
We describe a new technique for reducing the number of nodes and symbols in automata based on tries. The technique stems from some results on anti-dictionaries for data compression...
Maxime Crochemore, Chiara Epifanio, Roberto Grossi...