Computer Science Department, Technion, Haifa, 32000 Israel
Nir Friedman, Dan Geiger, Moisés Goldszmidt
Machine Learning, vol. 29,no. 2-3,1997 – ML
Recent work in supervised learning has shown that a surprisingly simple Bayesian classifier with strong assumptions of independence among features, called naive Bayes, is competitive with state-of-the-art classifiers such as C4.5. This fact raises ...
Kristin P. Bennett, Usama M. Fayyad, Dan Geiger
Proceedings of the 5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 1999 – KDD
We consider the problem of performing Nearest-neighbor queries efficiently over large high-dimensional databases. To avoid a full database scan, we target constructing a multidimensional index structure. It is well-accepted that traditional database ...
David Heckerman, Dan Geiger, David Maxwell Chickering
Machine Learning, vol. 20,no. 3,1995 – ML
We describe a Bayesian approach for learning Bayesian networks from a combination of prior knowledge and statistical data. First and foremost, we develop a methodology for assessing informative priors needed for learning. Our approach is derived ...
Mark Silberstein, Assaf Schuster, Dan Geiger, Anjul Patney, John D. Owens
22nd International Conference on Supercomputing, 2008 – ICS
We present a technique for designing memory-bound algorithms with high data reuse on Graphics Processing Units (GPUs) equipped with close-to-ALU software-managed memory. The approach is based on the efficient use of this memory through the ...
Mark Silberstein, Dan Geiger, Assaf Schuster, Miron Livny
Proceedings of the 15th IEEE International Symposium on High Performance Distributed Computing, HPDC-15, 2006 – HPDC
Consider a workload in which massively parallel tasks that require large resource pools are interleaved with short tasks that require fast response but consume fewer resources. We aim at achieving high throughput and short response time when ...
UAI '94: Proceedings of the Tenth Annual Conference on Uncertainty in Artificial Intelligence, 1994 – UAI
Reuven Bar-Yehuda, Dan Geiger, Joseph Naor, Ron M. Roth
SIAM Journal on Computing, vol. 27,no. 4,1998 – SICOMP
A feedback vertex set of an undirected graph is a subset of vertices that intersects with the vertex set of each cycle in the graph. Given an undirected graph G with n vertices and weights on its vertices, polynomial-time algorithms are provided for ...
The uneven recombination structure of human DNA has been highlighted by several recent studies. Knowledge of the haplotype blocks generated by this phenomenon can be applied to dramatically increase the statistical power of genetic mapping. Several ...