Sciweavers

3220 search results - page 95 / 644
» Constrained Graph Processes
Sort
View
ICPR
2002
IEEE
15 years 11 months ago
A New Algorithm for Inexact Graph Matching
The graph is an essential data structure for representing relational information. When graphs are used to represent objects, comparing objects amounts to graph matching. Inexact g...
Adel Hlaoui, Shengrui Wang
AIED
2007
Springer
15 years 4 months ago
Taking advantage of the Semantics of a Lesson Graph based on Learning Objects
Lesson graphs are composed of Learning Objects (LOs) and include a valuable amount of information about the content and usage of the LOs, described by the LO metadata. Graphs also ...
Olivier Motelet, Nelson Baloian, Benjamin Piwowars...
AIPS
2003
14 years 11 months ago
Reasoning about Autonomous Processes in an Estimated-Regression Planner
We examine the issues that arise in extending an estimatedregression (ER) planner to reason about autonomous processes that run and have continuous and discrete effects without th...
Drew V. McDermott
RSA
2010
99views more  RSA 2010»
14 years 8 months ago
Hamiltonicity thresholds in Achlioptas processes
In this paper we analyze the appearance of a Hamilton cycle in the following random process. The process starts with an empty graph on n labeled vertices. At each round we are pre...
Michael Krivelevich, Eyal Lubetzky, Benny Sudakov
EMNLP
2008
14 years 11 months ago
Learning Graph Walk Based Similarity Measures for Parsed Text
We consider a parsed text corpus as an instance of a labelled directed graph, where nodes represent words and weighted directed edges represent the syntactic relations between the...
Einat Minkov, William W. Cohen