Sciweavers

627 search results - page 25 / 126
» Branched Polyhedral Systems
Sort
View
BIRTHDAY
2008
Springer
13 years 10 months ago
Unfolding Graph Transformation Systems: Theory and Applications to Verification
The unfolding of a system represents in a single branching structure all its possible computations: it is the cornerstone both of semantical constructions and of efficient partial ...
Paolo Baldan, Andrea Corradini, Barbara König
JACM
2000
119views more  JACM 2000»
13 years 8 months ago
A subdivision-based algorithm for the sparse resultant
Multivariate resultants generalize the Sylvester resultant of two polynomials and characterize the solvability of a polynomial system. They also reduce the computation of all comm...
John F. Canny, Ioannis Z. Emiris
SLOGICA
2008
126views more  SLOGICA 2008»
13 years 8 months ago
On the Proof Theory of the Modal mu-Calculus
We study the proof-theoretic relationship between two deductive systems for the modal mu-calculus. First we recall an infinitary system which contains an omega rule allowing to de...
Thomas Studer
LAWEB
2005
IEEE
14 years 2 months ago
Incentive Networks
The concurrent growth of on-line communities exhibiting large-scale social structure, and of large decentralized peer-to-peer file-sharing systems, has stimulated new interest in...
Prabhakar Raghavan
ASIAN
2005
Springer
96views Algorithms» more  ASIAN 2005»
14 years 2 months ago
Query Incentive Networks
The concurrent growth of on-line communities exhibiting large-scale social structure, and of large decentralized peer-to-peer file-sharing systems, has stimulated new interest in...
Prabhakar Raghavan