Sciweavers

915 search results - page 46 / 183
» Proof labeling schemes
Sort
View
KDD
2006
ACM
113views Data Mining» more  KDD 2006»
14 years 8 months ago
A new efficient probabilistic model for mining labeled ordered trees
Mining frequent patterns is a general and important issue in data mining. Complex and unstructured (or semi-structured) datasets have appeared in major data mining applications, i...
Kosuke Hashimoto, Kiyoko F. Aoki-Kinoshita, Nobuhi...
SPIESR
2004
131views Database» more  SPIESR 2004»
13 years 9 months ago
Audio-visual event detection based on mining of semantic audio-visual labels
Removing commercials from television programs is a much sought-after feature for a personal video recorder. In this paper, we employ an unsupervised clustering scheme (CM Detect) ...
King-Shy Goh, Koji Miyahara, Regunathan Radhakrish...
FOSSACS
2004
Springer
14 years 1 months ago
Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting
Abstract. Motivated by recent work on the derivation of labelled transitions and bisimulation congruences from unlabelled reaction rules, we show how to solve this problem in the D...
Hartmut Ehrig, Barbara König
ENTCS
2007
96views more  ENTCS 2007»
13 years 7 months ago
An Observational Theory for Mobile Ad Hoc Networks
We propose a process calculus to study the behavioural theory of Mobile Ad Hoc Networks. The operational semantics of our calculus is given both in terms of a Reduction Semantics ...
Massimo Merro
EJC
2008
13 years 8 months ago
On Postnikov's hook length formula for binary trees
We present a combinatorial proof of Postnikov's hook length formula for binary trees. c 2007 Elsevier Ltd. All rights reserved. Let [n] = {1, 2, . . . , n}. It is well known ...
William Y. C. Chen, Laura L. M. Yang