Sciweavers

306 search results - page 10 / 62
» Underspecified computation of normal forms
Sort
View
SKG
2006
IEEE
14 years 1 months ago
Functional Dependency Maintenance and Lossless Join Decomposition in XML Model Decomposition
The paper studies “equality” in XML model decomposition. XML IFD, TFD, AFD and MVD are proposed. According to complexity of these FDs, four XML normal forms are presented. FD ...
Xia Li, Fei-yue Ye, Hong-juan Yuan, Wen-tao Peng
JAIR
2006
106views more  JAIR 2006»
13 years 7 months ago
Clause/Term Resolution and Learning in the Evaluation of Quantified Boolean Formulas
Resolution is the rule of inference at the basis of most procedures for automated reasoning. In these procedures, the input formula is first translated into an equisatisfiable for...
Enrico Giunchiglia, Massimo Narizzano, Armando Tac...
CVPR
2011
IEEE
13 years 2 months ago
Blind Deconvolution Using A Normalized Sparsity Measure
Blind image deconvolution is an ill-posed problem that requires regularization to solve. However, many common forms of image prior used in this setting have a major drawback in th...
Dilip Krishnan, Rob Fergus
EMMCVPR
2009
Springer
14 years 5 days ago
A Local Normal-Based Region Term for Active Contours
Global region-based active contours, like the Chan-Vese model, often make strong assumptions on the intensity distributions of the searched object and background, preventing their ...
Julien Mille, Laurent D. Cohen
TLCA
1993
Springer
13 years 11 months ago
The Conservation Theorem revisited
This paper describes a method of proving strong normalization based on an extension of the conservation theorem. We introduce a structural notion of reduction that we call βS, and...
Philippe de Groote