We study the subsequence packing problem: given a string T and a collection of strings {Si}, find disjoint subsequences {Ti} of T with maximum total length such that each Ti is a ...
We use Bernstein's Theorem [1] to obtain combinatorial bounds for the number of embeddings of Laman graph frameworks modulo rigid motions. For this, we study the mixed volume...
The design guidelines for micro diaphragm-type pressure sensors have been established by characterization of the relationships among diaphragm thickness, side length, sensitivity,...
Xiaodong Wang, Baoqing Li, Onofrio L. Russo, Harry...
We explore a new proxy-caching framework that exploits the query semantics of HTML forms. We identify a common class of form-based queries, and study two representative caching sc...
In our case study we investigate a server for answering OWLQL queries with distinguished variables only (henceforth called OWLQL). This server acts as a proxy that delegates queri...