— Databases associated with keywords, can be public, private or hybrid, as a result the solutions to keyword search protocols for each type are different. In this paper, we study...
With impressive progress in Boolean Satisfiability (SAT) solving and several extensions to pseudo-Boolean (PB) constraints, many applications that use SAT, such as highperformanc...
Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Kare...
We introduce a new graph-theoretic approach to image segmentation based on minimizing a novel class of `mean cut' cost functions. Minimizing these cost functions corresponds ...
We consider learning in a Markov decision process where we are not explicitly given a reward function, but where instead we can observe an expert demonstrating the task that we wa...
Abstract- We investigate the functions of given approximation order L that have the smallest support. Those are shown to be linear combinations of the Bspline of degree .L - 1 and ...