1225 search results - page 156 / 245 » The Instance Complexity Conjecture |
ERSHOV
2009
Springer
14 years 1 months ago
2009
Springer
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...
EMISA
2006
Springer
14 years 28 days ago
2006
Springer
Abstract: Web service technology offers a promising approach for realizing enterprisewide and cross-organizational business applications. With the Business Process Execution Langua...
NSDI
2008
13 years 11 months ago
2008
esn't display abstracts. Similar issues beset START (www.softconf.com), Linklings's RM 3.2 (www. linklings.com), and EasyChair (www.easychair.org). For instance, EasyChai...
PODS
2010
ACM
13 years 11 months ago
2010
ACM
Schema mappings are high-level specifications that describe the relationship between two database schemas; they are considered to be the essential building blocks in data exchange...
APPROX
2010
Springer
13 years 10 months ago
2010
Springer
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...