Sciweavers

11129 search results - page 1731 / 2226
» Modeling Search Computing Applications
Sort
View
ICDE
2000
IEEE
158views Database» more  ICDE 2000»
16 years 8 months ago
The DC-Tree: A Fully Dynamic Index Structure for Data Warehouses
: Many companies have recognized the strategic importance of the knowledge hidden in their large databases and have built data warehouses. Typically, updates are collected and appl...
Hans-Peter Kriegel, Jörn Kohlhammer, Martin E...
WWW
2007
ACM
16 years 7 months ago
Supervised rank aggregation
This paper is concerned with rank aggregation, the task of combining the ranking results of individual rankers at meta-search. Previously, rank aggregation was performed mainly by...
Yu-Ting Liu, Tie-Yan Liu, Tao Qin, Zhiming Ma, Han...
KDD
2005
ACM
125views Data Mining» more  KDD 2005»
16 years 7 months ago
Email data cleaning
Addressed in this paper is the issue of `email data cleaning' for text mining. Many text mining applications need take emails as input. Email data is usually noisy and thus i...
Jie Tang, Hang Li, Yunbo Cao, ZhaoHui Tang
SIGMOD
2009
ACM
213views Database» more  SIGMOD 2009»
16 years 7 months ago
Dictionary-based order-preserving string compression for main memory column stores
Column-oriented database systems [19, 23] perform better than traditional row-oriented database systems on analytical workloads such as those found in decision support and busines...
Carsten Binnig, Stefan Hildenbrand, Franz Fär...
SIGMOD
2009
ACM
190views Database» more  SIGMOD 2009»
16 years 7 months ago
Optimizing complex extraction programs over evolving text data
Most information extraction (IE) approaches have considered only static text corpora, over which we apply IE only once. Many real-world text corpora however are dynamic. They evol...
Fei Chen 0002, Byron J. Gao, AnHai Doan, Jun Yang ...
« Prev « First page 1731 / 2226 Last » Next »