We study the problem of rewriting queries using views in the presence of access patterns, integrity constraints, disjunction, and negation. We provide asymptotically optimal algori...
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the resul...
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
We consider the following model for fire containment. We are given an undirected graph G = (V, E) with a source vertex s where the fire starts. At each time step, the firefighters...
An intuitive approach to utilizing unlabeled data in kernel-based classification algorithms is to simply treat unknown labels as additional optimization variables. For marginbased...
Vikas Sindhwani, S. Sathiya Keerthi, Olivier Chape...