A graph U is (induced)-universal for a class of graphs X if every member of X is contained in U as an induced subgraph. We study the problem of finding a universal graph with min...
We generalize various notions of generalized metrics even further to one general concept comprising them all. For convenience, we turn around the ordering in the target domain of ...
We study the problem of answering ambiguous web queries in a setting where there exists a taxonomy of information, and that both queries and documents may belong to more than one ...
Rakesh Agrawal, Sreenivas Gollapudi, Alan Halverso...
The application of statistical methods to natural language processing has been remarkably successful over the past two decades. But, to deal with recent problems arising in this ...
We introduce a novel and general approach for digitalization of line segments in the plane that satisfies a set of axioms naturally arising from Euclidean axioms. In particular, ...