Sciweavers

11862 search results - page 34 / 2373
» Relative information completeness
Sort
View
WCRE
2003
IEEE
14 years 27 days ago
Completeness of a Fact Extractor
The process of software reverse engineering commonly uses an extractor, which parses source code and extracts facts about the code. The level of detail in these facts varies from ...
Yuan Lin, Richard C. Holt, Andrew J. Malton
DASFAA
2006
IEEE
111views Database» more  DASFAA 2006»
14 years 1 months ago
Holistic Schema Mappings for XML-on-RDBMS
When hosting XML information on relational backends, a mapping has to be established between the schemas of the information source and the target storage repositories. A rich body ...
Priti Patil, Jayant R. Haritsa
LICS
2002
IEEE
14 years 16 days ago
Complete Problems for Dynamic Complexity Classes
We present the first complete problems for dynamic complexity classes including the classes Dyn-FO and Dyn-ThC ¢ , the dynamic classes corresponding to relational calculus and (...
William Hesse, Neil Immerman
KR
2010
Springer
14 years 12 days ago
A Characterization of Optimality Criteria for Decision Making under Complete Ignorance
In this paper we present a model for decision making under complete ignorance. By complete ignorance it is meant that all that is known is the set of possible consequences associa...
Ramzi Ben Larbi, Sébastien Konieczny, Pierr...
DAM
2010
107views more  DAM 2010»
13 years 7 months ago
Codes from lattice and related graphs, and permutation decoding
Codes of length n2 and dimension 2n - 1 or 2n - 2 over the field Fp, for any prime p, that can be obtained from designs associated with the complete bipartite graph Kn,n and its l...
Jennifer D. Key, Bernardo Gabriel Rodrigues