Sciweavers

581 search results - page 35 / 117
» An Automata Model for Trees with Ordered Data Values
Sort
View
EDBT
2011
ACM
205views Database» more  EDBT 2011»
14 years 9 months ago
A probabilistic XML merging tool
This demonstration paper presents a probabilistic XML data merging tool, that represents the outcome of semi-structured document integration as a probabilistic tree. The system is...
Talel Abdessalem, M. Lamine Ba, Pierre Senellart
ISAAC
2005
Springer
111views Algorithms» more  ISAAC 2005»
15 years 11 months ago
Smoothed Analysis of Binary Search Trees
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
Bodo Manthey, Rüdiger Reischuk
DMIN
2006
137views Data Mining» more  DMIN 2006»
15 years 7 months ago
Discovering of Frequent Itemsets with CP-mine Algorithm
Efficient algorithms to discover frequent patterns are crucial in data mining research. Several effective data structures, such as two-dimensional arrays, graphs, trees, and tries ...
Nuansri Denwattana, Yutthana Treewai
ECAI
2004
Springer
15 years 11 months ago
Adversarial Constraint Satisfaction by Game-Tree Search
Many decision problems can be modelled as adversarial constraint satisfaction, which allows us to integrate methods from AI game playing. In particular, by using the idea of oppone...
Kenneth N. Brown, James Little, Páidí...
AIPRF
2008
15 years 7 months ago
Spam Sender Detection with Classification Modeling on Highly Imbalanced Mail Server Behavior Data
Unsolicited commercial or bulk emails or emails containing viruses pose a great threat to the utility of email communications. A recent solution for filtering is reputation systems...
Yuchun Tang, Sven Krasser, Dmitri Alperovitch, Pau...