Sciweavers

1950 search results - page 83 / 390
» Varieties of Increasing Trees
Sort
View
SIGMOD
1999
ACM
87views Database» more  SIGMOD 1999»
14 years 2 months ago
On Random Sampling over Joins
A major bottleneck in implementing sampling as a primitive relational operation is the ine ciency ofsampling the output of a query. It is not even known whether it is possible to ...
Surajit Chaudhuri, Rajeev Motwani, Vivek R. Narasa...
ESA
2008
Springer
106views Algorithms» more  ESA 2008»
13 years 11 months ago
An Experimental Analysis of Robinson-Foulds Distance Matrix Algorithms
In this paper, we study two fast algorithms--HashRF and PGM-Hashed--for computing the Robinson-Foulds (RF) distance matrix between a collection of evolutionary trees. The RF distan...
Seung-Jin Sul, Tiffani L. Williams
LREC
2008
89views Education» more  LREC 2008»
13 years 11 months ago
Parser Evaluation and the BNC: Evaluating 4 constituency parsers with 3 metrics
We evaluate discriminative parse reranking and parser self-training on a new English test set using four versions of the Charniak parser and a variety of parser evaluation metrics...
Jennifer Foster, Josef van Genabith
JIKM
2008
98views more  JIKM 2008»
13 years 10 months ago
Knowledge-Based Expert System Development and Validation with Petri Nets
Expert systems (ESs) are complex information systems that are expensive to build and difficult to validate. Numerous knowledge representation strategies such as rules, semantic net...
Madjid Tavana
PAMI
2000
113views more  PAMI 2000»
13 years 9 months ago
Hierarchical Discriminant Regression
This paper presents a new technique which incrementally builds a hierarchical discriminant regression (IHDR) tree for generation of motion based robot reactions. The robot learned...
Wey-Shiuan Hwang, Juyang Weng