Sciweavers

1060 search results - page 17 / 212
» On the Discovery of Random Trees
Sort
View
ISMB
1993
14 years 11 months ago
Knowledge Discovery in GENBANK
Wedescribe various methods designed to discover knowledge in the GenBanknucleic acid sequence database. Using a grammatical model of gene structure, we create a parse tree of a ge...
Jeffery S. Aaronson, Juergen Haas, G. Christian Ov...
CCECE
2006
IEEE
15 years 4 months ago
New Constraints on Generation of Uniform Random Samples from Evolutionary Trees
In this paper, we introduce new algorithms for selecting taxon samples from large evolutionary trees, maintaining uniformity and randomness, under certain new constraints on the t...
Anupam Bhattacharjee, Zalia Shams, Kazi Zakia Sult...
ETRICS
2006
15 years 1 months ago
Privacy-Preserving Decision Tree Mining Based on Random Substitutions
Privacy-preserving decision tree mining is an important problem that has yet to be thoroughly understood. In fact, the privacypreserving decision tree mining method explored in the...
Jim Dowd, Shouhuai Xu, Weining Zhang
SODA
2004
ACM
144views Algorithms» more  SODA 2004»
14 years 11 months ago
Covering minimum spanning trees of random subgraphs
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
Michel X. Goemans, Jan Vondrák
UCS
2007
Springer
15 years 4 months ago
A Media Access Protocol for Proactive Discovery in Ubiquitous Wireless Networks
A MAC protocol is proposed for proactive discovery in which wireless devices periodically broadcast packets containing presence or service information. The protocol is based on Fra...
Pavel Poupyrev, Peter Davis, Hiroyuki Morikawa