Sciweavers

2180 search results - page 179 / 436
» Algorithms for discovering bucket orders from data
Sort
View
EDBT
2009
ACM
118views Database» more  EDBT 2009»
16 years 1 months ago
Optimized union of non-disjoint distributed data sets
In a variety of applications, ranging from data integration to distributed query evaluation, there is a need to obtain sets of data items from several sources (peers) and compute ...
Itay Dar, Tova Milo, Elad Verbin
SIGMOD
2008
ACM
96views Database» more  SIGMOD 2008»
16 years 6 months ago
OLAP on sequence data
Many kinds of real-life data exhibit logical ordering among their data items and are thus sequential in nature. However, traditional online analytical processing (OLAP) systems an...
Eric Lo, Ben Kao, Wai-Shing Ho, Sau Dan Lee, Chun ...
WABI
2005
Springer
120views Bioinformatics» more  WABI 2005»
15 years 12 months ago
A Compressed Format for Collections of Phylogenetic Trees and Improved Consensus Performance
Phylogenetic tree searching algorithms often produce thousands of trees which biologists save in Newick format in order to perform further analysis. Unfortunately, Newick is neithe...
Robert S. Boyer, Warren A. Hunt Jr., Serita M. Nel...
PAKDD
2005
ACM
112views Data Mining» more  PAKDD 2005»
15 years 12 months ago
Approximated Clustering of Distributed High-Dimensional Data
In many modern application ranges high-dimensional feature vectors are used to model complex real-world objects. Often these objects reside on different local sites. In this paper,...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
PKDD
2007
Springer
143views Data Mining» more  PKDD 2007»
16 years 18 days ago
Using the Web to Reduce Data Sparseness in Pattern-Based Information Extraction
Textual patterns have been used effectively to extract information from large text collections. However they rely heavily on textual redundancy in the sense that facts have to be m...
Sebastian Blohm, Philipp Cimiano