Sciweavers

2635 search results - page 350 / 527
» Algorithms for the Database Layout Problem
Sort
View
KDD
2008
ACM
243views Data Mining» more  KDD 2008»
16 years 6 months ago
Permu-pattern: discovery of mutable permutation patterns with proximity constraint
Pattern discovery in sequences is an important problem in many applications, especially in computational biology and text mining. However, due to the noisy nature of data, the tra...
Meng Hu, Jiong Yang, Wei Su
195
Voted
CVPR
2010
IEEE
16 years 2 months ago
Online-Batch Strongly Convex Multi Kernel Learning
Several object categorization algorithms use kernel methods over multiple cues, as they offer a principled approach to combine multiple cues, and to obtain state-of-theart perform...
Francesco Orabona, Jie Luo, Barbara Caputo
ACIIDS
2009
IEEE
144views Database» more  ACIIDS 2009»
15 years 11 months ago
Processing Exact Results for Sliding Window Joins over Time-Sequence, Streaming Data Using a Disk Archive
— We consider the problem of processing exact results for sliding window joins over data streams with limited memory. Existing approaches deal with memory limitations by shedding...
Abhirup Chakraborty, Ajit Singh
ICDE
2000
IEEE
144views Database» more  ICDE 2000»
15 years 10 months ago
Practical Lineage Tracing in Data Warehouses
We consider the view data lineage problem in a warehousing environment: For a given data item in a materialized warehouse view, we want to identify the set of source data items th...
Yingwei Cui, Jennifer Widom
TALG
2010
110views more  TALG 2010»
15 years 4 months ago
Approximating fractional hypertree width
Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes from the fact that, as shown in previous work [14], ...
Dániel Marx