Sciweavers

4541 search results - page 408 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
ICCS
2007
Springer
15 years 11 months ago
Mining Frequent Closed Unordered Trees Through Natural Representations
Abstract. Many knowledge representation mechanisms consist of linkbased structures; they may be studied formally by means of unordered trees. Here we consider the case where labels...
José L. Balcázar, Albert Bifet, Anto...
KDD
1998
ACM
146views Data Mining» more  KDD 1998»
15 years 9 months ago
Mining Association Rules in Hypertext Databases
In this workweproposea generalisation of the notion of associationrule in the contextof flat transactions to that of a compositeassociation rule in the context of a structured dir...
José Borges, Mark Levene
121
Voted
FOSSACS
2006
Springer
15 years 8 months ago
Distributed Unfolding of Petri Nets
Some recent Petri net-based approaches to fault diagnosis of distributed systems suggest to factor the problem into local diagnoses based on the unfoldings of local views of the sy...
Paolo Baldan, Stefan Haar, Barbara König
IJAR
2006
89views more  IJAR 2006»
15 years 4 months ago
Learning probabilistic decision graphs
Probabilistic decision graphs (PDGs) are a representation language for probability distributions based on binary decision diagrams. PDGs can encode (context-specific) independence...
Manfred Jaeger, Jens D. Nielsen, Tomi Silander
ICRA
2010
IEEE
126views Robotics» more  ICRA 2010»
15 years 3 months ago
Planning short paths with clearance using explicit corridors
— A central problem of applications dealing with virtual environments is planning a collision-free path for a character. Since environments and their characters are growing more ...
Roland Geraerts