Sciweavers

4066 search results - page 70 / 814
» Almost Complete Sets
Sort
View
LOGCOM
1998
110views more  LOGCOM 1998»
13 years 9 months ago
leanTAP Revisited
A sequent calculus of a new sort is extracted from the Prolog program leanTAP. This calculus is sound and complete, even though it lacks almost all structural rules. Thinking of l...
Melvin Fitting
IEE
2002
72views more  IEE 2002»
13 years 9 months ago
Making inferences with small numbers of training sets
This paper discusses a potential methodological problem with empirical studies assessing project effort prediction systems. Frequently a hold-out strategy is deployed so that the ...
Colin Kirsopp, Martin J. Shepperd
AAAI
2011
12 years 10 months ago
Markov Logic Sets: Towards Lifted Information Retrieval Using PageRank and Label Propagation
Inspired by “GoogleTM Sets” and Bayesian sets, we consider the problem of retrieving complex objects and relations among them, i.e., ground atoms from a logical concept, given...
Marion Neumann, Babak Ahmadi, Kristian Kersting
JCST
2006
65views more  JCST 2006»
13 years 10 months ago
P-Tree Structures and Event Horizon: Efficient Event-Set Implementations
This paper describes efficient data structures, namely the Indexed P-tree, Block P-tree, and Indexed-Block P-tree (or IP-tree, BP-tree, and IBP-tree, respectively, for short), for...
Katerina Asdre, Stavros D. Nikolopoulos
VTC
2010
IEEE
175views Communications» more  VTC 2010»
13 years 8 months ago
Sensitivity Analysis of the Optimal Parameter Settings of an LTE Packet Scheduler
—Advanced packet scheduling schemes in 3G/3G+ mobile networks provide one or more parameters to optimise the trade-off between QoS and resource efficiency. In this paper we stud...
I. Fernandez Diaz, Desislava C. Dimitrova, Kathlee...