Sciweavers

4218 search results - page 194 / 844
» Complete sets of cooperations
Sort
View
ICDAR
2005
IEEE
14 years 4 months ago
Historical Recall and Precision: Summarizing Generated Hypotheses
Document recognition involves many kinds of hypotheses: segmentation hypotheses, classification hypotheses, spatial relationship hypotheses, and so on. Many recognition strategie...
Richard Zanibbi, Dorothea Blostein, James R. Cordy
CVPR
2003
IEEE
14 years 4 months ago
Graph-Theoretic Approach to Clustering and Segmentation
We develop a framework for the image segmentation problem based on a new graph-theoretic formulation of clustering. The approach is motivated by the analogies between the intuitiv...
Massimiliano Pavan, Marcello Pelillo
AAAI
1990
13 years 12 months ago
Solving Term Inequalities
This work pertains to the Knuth-Bendix (KB) algorithm which tries to find a complete set of reductions from a given set of equations. In the KB algorithm a term ordering is employ...
Gerald E. Peterson
SIGMOD
2006
ACM
153views Database» more  SIGMOD 2006»
14 years 11 months ago
Interactive query formulation over web service-accessed sources
Integration systems typically support only a restricted set of queries over the schema they export. The reason is that the participating information sources contribute limited con...
Michalis Petropoulos, Alin Deutsch, Yannis Papakon...
SAT
2009
Springer
121views Hardware» more  SAT 2009»
14 years 5 months ago
The Complexity of Reasoning for Fragments of Default Logic
Default logic was introduced by Reiter in 1980. In 1992, Gottlob classified the complexity of the extension existence problem for propositional default logic as Σp 2-complete, an...
Olaf Beyersdorff, Arne Meier, Michael Thomas, Heri...