Sciweavers

1996 search results - page 377 / 400
» A decision procedure for linear
Sort
View
KDD
2004
ACM
135views Data Mining» more  KDD 2004»
15 years 10 months ago
Discovering additive structure in black box functions
Many automated learning procedures lack interpretability, operating effectively as a black box: providing a prediction tool but no explanation of the underlying dynamics that driv...
Giles Hooker
76
Voted
KDD
2002
ACM
113views Data Mining» more  KDD 2002»
15 years 10 months ago
Scalable robust covariance and correlation estimates for data mining
Covariance and correlation estimates have important applications in data mining. In the presence of outliers, classical estimates of covariance and correlation matrices are not re...
Fatemah A. Alqallaf, Kjell P. Konis, R. Douglas Ma...
SIGMOD
2002
ACM
246views Database» more  SIGMOD 2002»
15 years 10 months ago
Hierarchical subspace sampling: a unified framework for high dimensional data reduction, selectivity estimation and nearest neig
With the increased abilities for automated data collection made possible by modern technology, the typical sizes of data collections have continued to grow in recent years. In suc...
Charu C. Aggarwal
105
Voted
WISEC
2009
ACM
15 years 5 months ago
Practical defenses against pollution attacks in intra-flow network coding for wireless mesh networks
Recent studies show that network coding can provide significant benefits to network protocols, such as increased throughput, reduced network congestion, higher reliability, and ...
Jing Dong, Reza Curtmola, Cristina Nita-Rotaru
107
Voted
ATAL
2007
Springer
15 years 4 months ago
A complete distributed constraint optimization method for non-traditional pseudotree arrangements
Distributed Constraint Optimization (DCOP) is a general framework that can model complex problems in multi-agent systems. Several current algorithms that solve general DCOP instan...
James Atlas, Keith Decker