312 search results - page 53 / 63 » An experimental study on algorithms for drawing binary trees |
KDD
1997
ACM
13 years 11 months ago
1997
ACM
We address the problem of nding useful regions for two-dimensional association rules and decision trees. In a previous paper we presented ecient algorithms for computing optimiz...
AIRS
2006
Springer
13 years 11 months ago
2006
Springer
We report on a study that was undertaken to better identify users' goals behind web search queries by using click through data. Based on user logs which contain over 80 millio...
FMSD
2007
13 years 7 months ago
2007
Symbolic techniques based on Binary Decision Diagrams (BDDs) are widely employed for reasoning about temporal properties of hardware circuits and synchronous controllers. However, ...
ADMA
2005
Springer
14 years 1 months ago
2005
Springer
Accurate probability-based ranking of instances is crucial in many real-world data mining applications. KNN (k-nearest neighbor) [1] has been intensively studied as an effective c...
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
Most of existing methods of keyword search over relational databases find the Steiner trees composed of relevant tuples as the answers. They identify the Steiner trees by discove...