Sciweavers

1605 search results - page 297 / 321
» On Partitional Labelings of Graphs
Sort
View
ECAI
2004
Springer
14 years 2 months ago
Towards a Logical Analysis of Biochemical Reactions
We provide a logical model of biochemical reactions and show how hypothesis generation using weakest sufficient and strongest necessary conditions may be used to provide addition...
Patrick Doherty, Steve Kertes, Martin Magnusson, A...
ITS
2004
Springer
130views Multimedia» more  ITS 2004»
14 years 2 months ago
Opening the Door to Non-programmers: Authoring Intelligent Tutor Behavior by Demonstration
Abstract. Intelligent tutoring systems are quite difficult and time intensive to develop. In this paper, we describe a method and set of software tools that ease the process of cog...
Kenneth R. Koedinger, Vincent Aleven, Neil T. Heff...
SIGMOD
1998
ACM
150views Database» more  SIGMOD 1998»
14 years 26 days ago
Extracting Schema from Semistructured Data
Semistructured data is characterized by the lack of any fixed and rigid schema, although typically the data hassomeimplicitstructure. While thelack offixedschemamakesextracting ...
Svetlozar Nestorov, Serge Abiteboul, Rajeev Motwan...
ESEC
1997
Springer
14 years 24 days ago
Verification of Liveness Properties Using Compositional Reachability Analysis
The software architecture of a distributed program can be represented by a hierarchical composition of subsystems, with interacting processes at the leaves of the hierarchy. Compo...
Shing-Chi Cheung, Dimitra Giannakopoulou, Jeff Kra...
CIDM
2007
IEEE
14 years 19 days ago
Efficient Kernel-based Learning for Trees
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...