Sciweavers

248 search results - page 36 / 50
» The Relative Complexity of NP Search Problems
Sort
View
ILP
1998
Springer
13 years 12 months ago
Learning Structurally Indeterminate Clauses
This paper describes a new kind of language bias, S-structural indeterminate clauses, which takes into account the meaning of predicates that play a key role in the complexity of l...
Jean-Daniel Zucker, Jean-Gabriel Ganascia
JAIR
2010
130views more  JAIR 2010»
13 years 6 months ago
A Constraint Satisfaction Framework for Executing Perceptions and Actions in Diagrammatic Reasoning
Diagrammatic reasoning (DR) is pervasive in human problem solving as a powerful adjunct to symbolic reasoning based on language-like representations. The research reported in this...
Bonny Banerjee, B. Chandrasekaran
CIKM
2009
Springer
14 years 2 months ago
A social recommendation framework based on multi-scale continuous conditional random fields
This paper addresses the issue of social recommendation based on collaborative filtering (CF) algorithms. Social recommendation emphasizes utilizing various attributes informatio...
Xin Xin, Irwin King, Hongbo Deng, Michael R. Lyu
CIKM
2008
Springer
13 years 9 months ago
Indexing and retrieval of a Greek corpus
Greek is one of the most difficult languages to handle in Web Information Retrieval (IR) related tasks. Its difficulty stems from the fact that it is grammatically, morphologicall...
Georgios Paltoglou, Michail Salampasis, Fotis Laza...
IS
2011
13 years 2 months ago
Similarity of business process models: Metrics and evaluation
—It is common for large and complex organizations to maintain repositories of business process models in order to document and to continuously improve their operations. Given suc...
Remco M. Dijkman, Marlon Dumas, Boudewijn F. van D...