1060 search results - page 38 / 212 » On the Discovery of Random Trees |
WALCOM
2010
IEEE
15 years 5 months ago
2010
IEEE
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...
105
click to vote
DIS
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. The Symposium on Computational Discovery of Communicable Knowledge was held from March 24 to 25, 2001, at Stanford University. Fifteen speakers reviewed recent advances i...
SOFSEM
2001
Springer
15 years 2 months ago
2001
Springer
Knowledge discovery, that is, to analyze a given massive data set and derive or discover some knowledge from it, has been becoming a quite important subject in several fields incl...
ISCAS
2008
IEEE
15 years 4 months ago
2008
IEEE
— In this paper we propose a method for lowering the power consumption in our previously proposed method for approximating elementary functions. By rearranging the interconnect o...
113
click to vote
ICONIP
2007
14 years 11 months ago
2007
Abstract. An effective way to examine causality is to conduct an experiment with random assignment. However, in many cases it is impossible or too expensive to perform controlled ...