Sciweavers

113 search results - page 7 / 23
» Solving Boolean Equations Using ROSOP Forms
Sort
View
MCMASTER
1993
15 years 2 months ago
A Taste of Rewrite Systems
Abstract. This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the Knuth-Bendix completion procedure and i...
Nachum Dershowitz
CVPR
2006
IEEE
16 years 4 days ago
A Closed Form Solution to Natural Image Matting
Interactive digital matting, the process of extracting a foreground object from an image based on limited user input, is an important task in image and video editing. From a compu...
Anat Levin, Dani Lischinski, Yair Weiss
STACS
2005
Springer
15 years 3 months ago
Algorithmics in Exponential Time
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
Uwe Schöning
COGSCI
2004
74views more  COGSCI 2004»
14 years 10 months ago
You'll see what you mean: Students encode equations based on their knowledge of arithmetic
This study investigated the roles of problem structure and strategy use in problem encoding. Fourthgrade students solved and explained a set of typical addition problems (e.g., 5 ...
Nicole M. McNeil, Martha W. Alibali
ICDE
2008
IEEE
129views Database» more  ICDE 2008»
15 years 11 months ago
Optimal Boolean Matrix Decomposition: Application to Role Engineering
Abstract-- A decomposition of a binary matrix into two matrices gives a set of basis vectors and their appropriate combination to form the original matrix. Such decomposition solut...
Haibing Lu, Jaideep Vaidya, Vijayalakshmi Atluri