1060 search results - page 9 / 212 » On the Discovery of Random Trees |
SAGA
2007
Springer
15 years 4 months ago
2007
Springer
In the layered-graph query model of network discovery, a query at a node v of an undirected graph G discovers all edges and non-edges whose endpoints have different distance from ...
WWW
2008
ACM
15 years 10 months ago
2008
ACM
The rapid growth of the number of videos in YouTube provides enormous potential for users to find content of interest to them. Unfortunately, given the difficulty of searching vid...
ICCV
2007
IEEE
15 years 11 months ago
2007
IEEE
Automatically discovering common visual patterns from a collection of images is an interesting but yet challenging task, in part because it is computationally prohibiting. Althoug...
ALT
2010
Springer
14 years 11 months ago
2010
Springer
We show that random DNF formulas, random log-depth decision trees and random deterministic finite acceptors cannot be weakly learned with a polynomial number of statistical queries...
102
click to vote
UAI
2000
14 years 11 months ago
2000
Decision theory does not traditionally include uncertainty over utility functions. We argue that the a person's utility value for a given outcome can be treated as we treat o...