Sciweavers

72 search results - page 9 / 15
» Generation of Oriented Matroids - A Graph Theoretical Approa...
Sort
View
ICIAP
2003
ACM
14 years 21 days ago
Color matching by using tuple matching
In this paper we present a new matching method called Tuple Matching (TM), which is an algorithm for matching of signatures. Since signatures can contain arbitrary features like c...
Dirk Balthasar
AI
2006
Springer
13 years 7 months ago
Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
This article presents and analyzes algorithms that systematically generate random Bayesian networks of varying difficulty levels, with respect to inference using tree clustering. ...
Ole J. Mengshoel, David C. Wilkins, Dan Roth
SDM
2004
SIAM
163views Data Mining» more  SDM 2004»
13 years 8 months ago
Basic Association Rules
Previous approaches for mining association rules generate large sets of association rules. Such sets are difficult for users to understand and manage. Here, the concept of a restri...
Guichong Li, Howard J. Hamilton
CADE
2007
Springer
14 years 7 months ago
Dependency Pairs for Rewriting with Non-free Constructors
Abstract. A method based on dependency pairs for showing termination of functional programs on data structures generated by constructors with relations is proposed. A functional pr...
Stephan Falke, Deepak Kapur
COMSIS
2010
13 years 4 months ago
Multi-video summarization using complex graph clustering and mining
Multi-video summarization is a great theoretical and technical challenge due to the wider diversity of topics in multi-video than singlevideo as well as the multi-modality nature o...
Jian Shao, Dongming Jiang, Mengru Wang, Hong Chen,...