321 search results - page 34 / 65 » Comparison of Additive Trees Using Circular Orders |
164
click to vote
ICDM
2006
IEEE
15 years 11 months ago
2006
IEEE
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...
117
click to vote
ICSE
2009
IEEE-ACM
16 years 6 months ago
2009
IEEE-ACM
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 ...
141
Voted
TACAS
2010
Springer
16 years 10 days ago
2010
Springer
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 ...
161
click to vote
VLDB
1995
ACM
15 years 9 months ago
1995
ACM
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...
125
Voted
AH
2004
Springer
15 years 10 months ago
2004
Springer
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...