Sciweavers

284 search results - page 56 / 57
» Sensitivity Analysis of the Result in Binary Decision Trees
Sort
View
FOCS
1998
IEEE
13 years 10 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello
KDD
2007
ACM
566views Data Mining» more  KDD 2007»
14 years 6 months ago
IMDS: intelligent malware detection system
The proliferation of malware has presented a serious threat to the security of computer systems. Traditional signature-based antivirus systems fail to detect polymorphic and new, ...
Yanfang Ye, Dingding Wang, Tao Li, Dongyi Ye
ICIAP
2007
ACM
14 years 5 months ago
Window Detection in Facades
This work is about a novel methodology for window detection in urban environments and its multiple use in vision system applications. The presented method for window detection inc...
Haider Ali, Christin Seifert, Nitin Jindal, Lucas ...
IPSN
2009
Springer
14 years 17 days ago
Distributed resource management and matching in sensor networks
We consider a scenario in which there are resources at or near nodes of a network, which are either static (e.g. fire stations, parking spots) or mobile (e.g. police cars). Over ...
Jie Gao, Leonidas J. Guibas, Nikola Milosavljevic,...
ESANN
2006
13 years 7 months ago
Random Forests Feature Selection with K-PLS: Detecting Ischemia from Magnetocardiograms
Random Forests were introduced by Breiman for feature (variable) selection and improved predictions for decision tree models. The resulting model is often superior to AdaBoost and ...
Long Han, Mark J. Embrechts, Boleslaw K. Szymanski...