Sciweavers

2479 search results - page 339 / 496
» Quantum complexity theory
Sort
View
KDD
2009
ACM
168views Data Mining» more  KDD 2009»
16 years 1 months ago
Cartesian contour: a concise representation for a collection of frequent sets
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
Ruoming Jin, Yang Xiang, Lin Liu
LATA
2009
Springer
16 years 1 months ago
Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata
We show that fixed membership testing for many interesting subclasses of multi-pushdown machines is no harder than for pushdowns with single stack. The models we consider are MVPA...
Nutan Limaye, Meena Mahajan
LATA
2009
Springer
16 years 1 months ago
From Gene Trees to Species Trees through a Supertree Approach
Abstract. Gene trees are leaf-labeled trees inferred from molecular sequences. Due to duplication events arising in genome evolution, gene trees usually have multiple copies of som...
Celine Scornavacca, Vincent Berry, Vincent Ranwez
LATA
2009
Springer
16 years 1 months ago
Matching Trace Patterns with Regular Policies
Abstract. We consider policies that are described by regular expressions, finite automata, or formulae of linear temporal logic (LTL). Such policies are assumed to describe situat...
Franz Baader, Andreas Bauer 0002, Alwen Tiu
ICDM
2009
IEEE
105views Data Mining» more  ICDM 2009»
16 years 1 months ago
Multi-document Summarization by Information Distance
—We are now living in a world where information is growing and updating quickly. Knowledge can be acquired more efficiently with the help of automatic document summarization and...
Chong Long, Minlie Huang, Xiaoyan Zhu, Ming Li