2917 search results - page 199 / 584 » Satisfying Interaction Constraints |
189
click to vote
JAR
2006
15 years 6 months ago
2006
The dependency pair technique [1, 11, 12] is a powerful method for automated termination and innermost termination proofs of term rewrite systems (TRSs). For any TRS, it generates ...
181
click to vote
TSP
2008
15 years 6 months ago
2008
This paper proposes a hierarchical Bayesian model that can be used for semi-supervised hyperspectral image unmixing. The model assumes that the pixel reflectances result from linea...
167
click to vote
IJCV
2000
15 years 6 months ago
2000
We present a universal statistical model for texture images in the context of an overcomplete complex wavelet transform. The model is parameterized by a set of statistics computed ...
164
click to vote
AUTOMATICA
2010
15 years 6 months ago
2010
: The guarantee of feasibility given feasibility at initial time is an issue that has been overlooked by many of the recent papers on stochastic model predictive control. Effective...
160
click to vote
PVLDB
2010
15 years 5 months ago
2010
We show that it is possible to significantly improve the accuracy of a general class of histogram queries while satisfying differential privacy. Our approach carefully chooses a...