Sciweavers

446 search results - page 76 / 90
» Learning discrete categorial grammars from structures
Sort
View
TOPLAS
2008
81views more  TOPLAS 2008»
13 years 7 months ago
Size-change termination with difference constraints
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
Amir M. Ben-Amram
PPDP
2010
Springer
13 years 5 months ago
Precise complexity analysis for efficient datalog queries
Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting with the facts or top-down starting with the query. For efficiently answe...
K. Tuncay Tekle, Yanhong A. Liu
GECCO
2006
Springer
124views Optimization» more  GECCO 2006»
13 years 11 months ago
Genetic programming for human oral bioavailability of drugs
Automatically assessing the value of bioavailability from the chemical structure of a molecule is a very important issue in biomedicine and pharmacology. In this paper, we present...
Francesco Archetti, Stefano Lanzeni, Enza Messina,...
SAC
2010
ACM
14 years 2 months ago
Referrer graph: a low-cost web prediction algorithm
This paper presents the Referrer Graph (RG) web prediction algorithm as a low-cost solution to predict next web user accesses. RG is aimed at being used in a real web system with ...
B. de la Ossa, Ana Pont, Julio Sahuquillo, Jos&eac...
CIKM
2009
Springer
14 years 2 months ago
MRM: an adaptive framework for XML searching
In order to deal with the diversified nature of XML documents as well as individual user preferences, we propose a novel Multiodel (MRM), which is able to abstract a spectrum of i...
Ho Lam Lau, Wilfred Ng