306 search results - page 39 / 62 » Underspecified computation of normal forms |
137
click to vote
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
Negation-limited circuits have been studied as a circuit model between general circuits and monotone circuits. In this paper, we consider limiting negations in formulas. The minimu...
109
click to vote
ICML
2008
IEEE
16 years 3 months ago
2008
IEEE
In real-world machine learning problems, it is very common that part of the input feature vector is incomplete: either not available, missing, or corrupted. In this paper, we pres...
126
Voted
CPAIOR
2007
Springer
15 years 9 months ago
2007
Springer
A linear pseudo-Boolean constraint (LPB) is an expression of the form a1 · 1 + . . . + am · m ≥ d, where each i is a literal (it assumes the value 1 or 0 depending on whether a...
123
click to vote
ICTAC
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. The classical work on test case generation and formal methods focuses either on algebraic or model-based specifications. In this paper we propose an approach to derive t...
141
click to vote
SGP
2004
15 years 5 months ago
2004
We propose a method for segmentation of 3D scanned shapes into simple geometric parts. Given an input point cloud, our method computes a set of components which possess one or mor...