Sciweavers

1060 search results - page 55 / 212
» On the Discovery of Random Trees
Sort
View
ICML
2005
IEEE
15 years 10 months ago
Generalized skewing for functions with continuous and nominal attributes
This paper extends previous work on skewing, an approach to problematic functions in decision tree induction. The previous algorithms were applicable only to functions of binary v...
Soumya Ray, David Page
INFORMATICALT
2002
150views more  INFORMATICALT 2002»
14 years 9 months ago
Application of Data Mining Technique for Diagnosis of Posterior Uveal Melanoma
Application of knowledge discovery in databases (data mining) for medical decision support is discussed in this work. The aim of the study was to use decision support algorithm for...
Darius Jegelevicius, Arunas Lukosevicius, Alvydas ...
ICDCS
2011
IEEE
13 years 9 months ago
JR-SND: Jamming-Resilient Secure Neighbor Discovery in Mobile Ad Hoc Networks
Abstract—Secure neighbor discovery is fundamental to mobile ad hoc networks (MANETs) deployed in hostile environments and refers to the process in which two neighboring nodes exc...
Rui Zhang 0007, Yanchao Zhang, Xiaoxia Huang
AAAI
2008
15 years 11 days ago
Backdoor Trees
The surprisingly good performance of modern satisfiability (SAT) solvers is usually explained by the existence of a certain "hidden structure" in real-world instances. W...
Marko Samer, Stefan Szeider
COLING
1996
14 years 11 months ago
Error-tolerant Tree Matching
This paper presents an efficient algorithm for retrieving from a database of trees, all trees that match a given query tree appro,imately, that is, within a certain error toleranc...
Kemal Oflazer