Sciweavers

1060 search results - page 12 / 212
» On the Discovery of Random Trees
Sort
View
SODA
1998
ACM
144views Algorithms» more  SODA 1998»
14 years 11 months ago
Analysis of Random Processes via And-Or Tree Evaluation
We introduce a new set of probabilistic analysis tools based on the analysis of And-Or trees with random inputs. These tools provide a unifying, intuitive, and powerful framework ...
Michael Luby, Michael Mitzenmacher, Mohammad Amin ...
ADC
2003
Springer
153views Database» more  ADC 2003»
15 years 3 months ago
Automated Discovery of Search Interfaces on the Web
Web search engines work well for finding crawlable pages, but not for finding datasets hidden behind Web search forms. We describe a novel technique for detecting search forms, ...
Jared Cope, Nick Craswell, David Hawking
ACTA
2008
88views more  ACTA 2008»
14 years 8 months ago
Weighted height of random trees
We consider a model of random trees similar to the split trees of Devroye [30] in which a set of items is recursively partitioned. Our model allows for more flexibility in the cho...
Nicolas Broutin, Luc Devroye, Erin McLeish
RSA
2006
98views more  RSA 2006»
14 years 9 months ago
Levels of a scale-free tree
Consider the random graph model of Barab
Zsolt Katona
EMNLP
2009
14 years 7 months ago
Natural Language Generation with Tree Conditional Random Fields
This paper presents an effective method for generating natural language sentences from their underlying meaning representations. The method is built on top of a hybrid tree repres...
Wei Lu, Hwee Tou Ng, Wee Sun Lee