Sciweavers

321 search results - page 34 / 65
» Comparison of Additive Trees Using Circular Orders
Sort
View
ICDM
2006
IEEE
176views Data Mining» more  ICDM 2006»
15 years 5 months ago
Razor: mining distance-constrained embedded subtrees
Due to their capability for expressing semantics and relationships among data objects, semi-structured documents have become a common way of representing domain knowledge. Compari...
Henry Tan, Tharam S. Dillon, Fedja Hadzic, Elizabe...
ICSE
2009
IEEE-ACM
16 years 17 days ago
FEATUREHOUSE: Language-independent, automated software composition
Superimposition is a composition technique that has been applied successfully in many areas of software development. Although superimposition is a general-purpose concept, it has ...
Christian Kästner, Christian Lengauer, Sven A...
85
Voted
TACAS
2010
Springer
181views Algorithms» more  TACAS 2010»
15 years 6 months ago
Boom: Taking Boolean Program Model Checking One Step Further
Abstract. We present Boom, a comprehensive analysis tool for Boolean programs. We focus in this paper on model-checking non-recursive concurrent programs. Boom implements a recent ...
Gérard Basler, Matthew Hague, Daniel Kroeni...
VLDB
1995
ACM
132views Database» more  VLDB 1995»
15 years 3 months ago
Coloring Away Communication in Parallel Query Optimization
We address the problem of finding parallel plans for SQL queries using the two-phase approach of join ordering and query rewrite (JOQR) followed by parallelization. We focus on t...
Waqar Hasan, Rajeev Motwani
AH
2004
Springer
15 years 5 months ago
Machine Learning Methods for One-Session Ahead Prediction of Accesses to Page Categories
This paper presents a comparison among several well-known machine learning techniques when they are used to carry out a one-session ahead prediction of page categories. We use reco...
José David Martín-Guerrero, Emili Ba...