Sciweavers

481 search results - page 28 / 97
» Learning relational probability trees
Sort
View
AAAI
2007
13 years 10 months ago
Recognizing Textual Entailment Using a Subsequence Kernel Method
We present a novel approach to recognizing Textual nt. Structural features are constructed from abstract tree descriptions, which are automatically extracted from syntactic depend...
Rui Wang 0005, Günter Neumann
IJCV
2008
186views more  IJCV 2008»
13 years 7 months ago
Multi-Class Segmentation with Relative Location Prior
Multi-class image segmentation has made significant advances in recent years through the combination of local and global features. One important type of global feature is that of i...
Stephen Gould, Jim Rodgers, David Cohen, Gal Elida...
PODS
2003
ACM
135views Database» more  PODS 2003»
14 years 7 months ago
Query-preserving watermarking of relational databases and XML documents
Watermarking allows robust and unobtrusive insertion of information in a digital document. Very recently, techniques have been proposed for watermarking relational databases or XM...
David Gross-Amblard
BIBE
2007
IEEE
124views Bioinformatics» more  BIBE 2007»
14 years 1 months ago
Finding Cancer-Related Gene Combinations Using a Molecular Evolutionary Algorithm
—High-throughput data such as microarrays make it possible to investigate the molecular-level mechanism of cancer more efficiently. Computational methods boost the microarray ana...
Chan-Hoon Park, Soo-Jin Kim, Sun Kim, Dong-Yeon Ch...
ML
2010
ACM
210views Machine Learning» more  ML 2010»
13 years 6 months ago
Mining frequent closed rooted trees
Many knowledge representation mechanisms are based on tree-like structures, thus symbolizing the fact that certain pieces of information are related in one sense or another. There ...
José L. Balcázar, Albert Bifet, Anto...