Sciweavers

5158 search results - page 794 / 1032
» Generalization of the Dempster-Shafer Theory
Sort
View
IANDC
2010
68views more  IANDC 2010»
15 years 5 months ago
On the complexity of checking semantic equivalences between pushdown processes and finite-state processes
Simulation preorder/equivalence and bisimulation equivalence are the most commonly used equivalences in concurrency theory. Their standard definitions are often called strong sim...
Antonín Kucera, Richard Mayr
ICTAC
2010
Springer
15 years 5 months ago
A Modality for Safe Resource Sharing and Code Reentrancy
Abstract. The potential of linear logic in facilitating reasoning on resource usage has long been recognized. However, convincing uses of linear types in practical programming are ...
Rui Shi, Dengping Zhu, Hongwei Xi
IDEAS
2010
IEEE
238views Database» more  IDEAS 2010»
15 years 5 months ago
An integrative approach to query optimization in native XML database management systems
Even though an effective cost-based query optimizer is of utmost importance for the efficient evaluation of XQuery expressions in native XML database systems, such a component is...
Andreas M. Weiner, Theo Härder
IJCBDD
2010
127views more  IJCBDD 2010»
15 years 5 months ago
Predicting protein complexes by data integration of different types of interactions
: The explosion of highthroughput interaction data from proteomics studies gives us the opportunity to integrate Protein-Protein Interactions (PPI) from different type of interacti...
Powell Patrick Cheng Tan, Daryanaz Dargahi, Freder...
JCT
2010
114views more  JCT 2010»
15 years 5 months ago
An almost quadratic bound on vertex Folkman numbers
The vertex Folkman number F(r, n, m), n < m, is the smallest integer t such that there exists a Km-free graph of order t with the property that every r-coloring of its vertices...
Andrzej Dudek, Vojtech Rödl