Sciweavers

1425 search results - page 140 / 285
» Beyond Dependency Graphs
Sort
View
FSE
2005
Springer
116views Cryptology» more  FSE 2005»
14 years 1 months ago
Narrow T-Functions
T-functions were introduced by Klimov and Shamir in a series of papers during the last few years. They are of great interest for cryptography as they may provide some new building ...
Magnus Daum
ICCS
2001
Springer
14 years 22 days 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
CPE
1994
Springer
170views Hardware» more  CPE 1994»
14 years 11 days 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...
ICCS
2007
Springer
14 years 4 days 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
ENTCS
2006
135views more  ENTCS 2006»
13 years 8 months 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