Sciweavers

4095 search results - page 234 / 819
» How to test a tree
Sort
View
91
Voted
AIEDAM
1999
79views more  AIEDAM 1999»
15 years 7 days ago
An algorithmic approach to knowledge evolution
Intelligent agents must update their knowledge base as they acquire new information about their environment. The modal logic S5n has been designed for representing knowledge bases...
Alessio Lomuscio, Mark Ryan
112
Voted
NAACL
2010
14 years 10 months ago
Convolution Kernels for Opinion Holder Extraction
Opinion holder extraction is one of the important subtasks in sentiment analysis. The effective detection of an opinion holder depends on the consideration of various cues on vari...
Michael Wiegand, Dietrich Klakow
98
Voted
CSR
2008
Springer
15 years 2 months ago
Comparing Universal Covers in Polynomial Time
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...
Jirí Fiala, Daniël Paulusma
134
Voted
ISAMI
2010
14 years 10 months ago
A Data Mining Approach for the Detection of High-Risk Breast Cancer Groups
It is widely agreed that complex diseases are typically caused by the joint effects of multiple instead of a single genetic variation. These genetic variations may show very little...
Orlando Anunciação, Bruno C. Gomes, ...
101
Voted
IAAI
2001
15 years 1 months ago
Constraint-Based Modeling of InterOperability Problems Using an Object-Oriented Approach
ADIOP is an application for Automated Diagnosis of InterOperability Problems. Interoperability testing involves checking the degree of compatibility between two networking devices...
Mohammed H. Sqalli, Eugene C. Freuder