Sciweavers

20 search results - page 3 / 4
» Representations of directed strongly regular graphs
Sort
View
ICCS
2009
Springer
14 years 24 days ago
Distinguishing Answers in Conceptual Graph Knowledge Bases
Abstract. In knowledge bases, the open world assumption and the ability to express variables may lead to an answer redundancy problem. This problem occurs when the returned answers...
Nicolas Moreau, Michel Leclère, Madalina Cr...
IJCAI
1997
13 years 7 months ago
Machine Learning Techniques to Make Computers Easier to Use
Identifying user-dependent information that can be automatically collected helps build a user model by which 1) to predict what the user wants to do next and 2) to do relevant pre...
Hiroshi Motoda, Kenichi Yoshida
PSTV
1993
123views Hardware» more  PSTV 1993»
13 years 7 months ago
On the Verification of Temporal Properties
We present a new algorithm that can be used for solving the model−checking problem for linear−time temporal logic. This algorithm can be viewed as the combination of two exist...
Patrice Godefroid, Gerard J. Holzmann
NIPS
2008
13 years 7 months ago
Learning with Consistency between Inductive Functions and Kernels
Regularized Least Squares (RLS) algorithms have the ability to avoid over-fitting problems and to express solutions as kernel expansions. However, we observe that the current RLS ...
Haixuan Yang, Irwin King, Michael R. Lyu
MST
2010
101views more  MST 2010»
13 years 4 months ago
Automatic Presentations and Semigroup Constructions
atic presentation for a relational structure is, informally, an abstract representation of the elements of that structure by means of a regular language such that the relations ca...
Alan J. Cain, Graham P. Oliver, Nikola Ruskuc, Ric...