Sciweavers

1284 search results - page 120 / 257
» Data Structures for Mergeable Trees
Sort
View
CADE
2008
Springer
14 years 8 months ago
Automated Induction with Constrained Tree Automata
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
Adel Bouhoula, Florent Jacquemard
WAIM
2004
Springer
14 years 1 months ago
Mining Web Sequential Patterns Incrementally with Revised PLWAP Tree
Since point and click at web pages generate continuous data stream, which flow into web log data, old patterns may be stale and need to be updated. Algorithms for mining web seque...
Christie I. Ezeife, Min Chen
INFOVIS
2003
IEEE
14 years 1 months ago
Visualization of Large-Scale Customer Satisfaction Surveys Using a Parallel Coordinate Tree
Satisfaction surveys are an important measurement tool in fields such as market research or human resources management. Serious studies consist of numerous questions and contain a...
Dominique Brodbeck, Luc Girardin
EUROMICRO
1999
IEEE
14 years 1 days ago
Software Synthesis for System Level Design Using Process Execution Trees
Software synthesis for system level design languages becomes feasible because the current technology, pricing and application trends will most likely alleviate the industrial empha...
Leo J. van Bokhoven, Jeroen Voeten, Marc Geilen
SDM
2010
SIAM
158views Data Mining» more  SDM 2010»
13 years 9 months ago
On the Use of Combining Rules in Relational Probability Trees
A relational probability tree (RPT) is a type of decision tree that can be used for probabilistic classification of instances with a relational structure. Each leaf of an RPT cont...
Daan Fierens