4066 search results - page 122 / 814 » Almost Complete Sets |
173
click to vote
ICAPR
2005
Springer
15 years 12 months ago
2005
Springer
The RW algorithm has been proposed recently to solve the exact graph matching problem. This algorithm exploits Random Walk theory to compute a topological signature which can be u...
171
click to vote
SEMWEB
2001
Springer
15 years 10 months ago
2001
Springer
Resource discovery is a problem common to almost all distributed systems. Instead of resulting in a one or a small number of discovery mechanisms, completely different and incompa...
173
click to vote
NPAR
2000
ACM
15 years 10 months ago
2000
ACM
We present an algorithm for rendering subdivision surface models of complex scenes in a variety of artistic styles using an interactively editable particle system. The algorithm i...
167
click to vote
ADBIS
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. In [1, 8] we proposed a complete design of a workflow management system using mobile agents. The proposed solution was highly distributed and almost without centralized ...
170
click to vote
FSTTCS
1993
Springer
15 years 10 months ago
1993
Springer
This paper will show the usefulness and elegance of strict intersection types for the Lambda Calculus; these are strict in the sense that they are the representatives of equivalen...