Sciweavers

145 search results - page 8 / 29
» Parameterized Complexity Classes under Logical Reductions
Sort
View
CORR
2011
Springer
174views Education» more  CORR 2011»
14 years 5 months ago
Parameter Learning of Logic Programs for Symbolic-Statistical Modeling
We propose a logical/mathematical framework for statistical parameter learning of parameterized logic programs, i.e. de nite clause programs containing probabilistic facts with a ...
Yoshitaka Kameya, Taisuke Sato
AMW
2010
15 years 3 months ago
Query Rewriting under Non-Guarded Rules
We address the problem of answering conjunctive queries over knowledge bases, specified by sets of first-order sentences called tuple-generating dependencies (TGDs). This problem i...
Andrea Calì, Georg Gottlob, Andreas Pieris
EUSFLAT
2009
166views Fuzzy Logic» more  EUSFLAT 2009»
14 years 11 months ago
Approximations by Interval, Triangular and Trapezoidal Fuzzy Numbers
Abstract-- Recently, many scholars investigated interval, triangular, and trapezoidal approximations of fuzzy numbers. These researches can be grouped into two classes: the Euclide...
Chi-Tsuen Yeh
COCOON
2007
Springer
15 years 8 months ago
Connected Coloring Completion for General Graphs: Algorithms and Complexity
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
Benny Chor, Michael R. Fellows, Mark A. Ragan, Igo...
TC
2010
14 years 8 months ago
Model-Driven System Capacity Planning under Workload Burstiness
In this paper, we define and study a new class of capacity planning models called MAP queueing networks. MAP queueing networks provide the first analytical methodology to describe ...
Giuliano Casale, Ningfang Mi, Evgenia Smirni