Sciweavers

3652 search results - page 58 / 731
» A study of query length
Sort
View
AAIM
2006
Springer
75views Algorithms» more  AAIM 2006»
14 years 1 months ago
Subsequence Packing: Complexity, Approximation, and Application
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 ...
Minghui Jiang
COMGEO
2010
ACM
13 years 8 months ago
Mixed volume techniques for embeddings of Laman graphs
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...
Reinhard Steffens, Thorsten Theobald
MJ
2006
173views more  MJ 2006»
13 years 7 months ago
Diaphragm design guidelines and an optical pressure sensor based on MEMS technique
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...
VLDB
2001
ACM
102views Database» more  VLDB 2001»
14 years 7 days ago
Form-Based Proxy Caching for Database-Backed Web Sites
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...
Qiong Luo, Jeffrey F. Naughton
DLOG
2006
13 years 9 months ago
Experiences with Load Balancing and Caching for Semantic Web Applications
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...
Alissa Kaplunova, Atila Kaya, Ralf Möller