Sciweavers

1161 search results - page 114 / 233
» Kinetic Dependence Graphs
Sort
View
ICCS
2001
Springer
15 years 5 months ago
Learning to Generate CGs from Domain Specific Sentences
Automatically generating Conceptual Graphs (CGs) [1] from natural language sentences is a difficult task in using CG as a semantic (knowledge) representation language for natural l...
Lei Zhang, Yong Yu
161
Voted
CPE
1994
Springer
170views Hardware» more  CPE 1994»
15 years 4 months ago
Automatic Scalability Analysis of Parallel Programs Based on Modeling Techniques
When implementingparallel programs forparallel computer systems the performancescalability of these programs should be tested and analyzed on different computer configurations and...
Allen D. Malony, Vassilis Mertsiotakis, Andreas Qu...
105
Voted
ICCS
2007
Springer
15 years 4 months ago
A Comparison of Different Conceptual Structures Projection Algorithms
Knowledge representation (KR) is used to store and retrieve meaningful data. This data is saved using dynamic data structures that are suitable for the style of KR being implemente...
Heather D. Pfeiffer, Roger T. Hartley
79
Voted
ENTCS
2006
135views more  ENTCS 2006»
15 years 20 days ago
Initializing Mutually Referential Abstract Objects: The Value Recursion Challenge
zing Mutually Referential Abstract Objects: The Value Recursion Challenge Don Syme 1 Microsoft Research, Cambridge, U.K. Mutual dependencies between objects arise frequently in pr...
Don Syme
TSP
2008
151views more  TSP 2008»
15 years 17 days ago
Convergence Analysis of Reweighted Sum-Product Algorithms
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...
Tanya Roosta, Martin J. Wainwright, Shankar S. Sas...