Sciweavers

2853 search results - page 368 / 571
» On Coherence in Computer Algebra
Sort
View
MFCS
1997
Springer
15 years 7 months ago
Dependency-Based Action Refinement
Abstract. Action refinement in process algebras has been widely studied in the last few years as a means to support top-down design of systems. A specific notion of refinement aris...
Arend Rensink, Heike Wehrheim
DAC
1994
ACM
15 years 7 months ago
Probabilistic Analysis of Large Finite State Machines
Regarding nite state machines as Markov chains facilitates the application of probabilistic methods to very large logic synthesis and formal veri cation problems. Recently, we ha...
Gary D. Hachtel, Enrico Macii, Abelardo Pardo, Fab...
ECCV
2010
Springer
15 years 6 months ago
Towards More Efficient and Effective LP-based algorithms for MRF Optimization
This paper proposes a framework that provides significant speed-ups and also improves the effectiveness of general message passing algorithms based on dual LP relaxations. It is ap...
AISC
2008
Springer
15 years 6 months ago
Automating Side Conditions in Formalized Partial Functions
Abstract. Assumptions about the domains of partial functions are necessary in state-of-the-art proof assistants. On the other hand when mathematicians write about partial functions...
Cezary Kaliszyk
COCO
2006
Springer
88views Algorithms» more  COCO 2006»
15 years 6 months ago
Polynomial Identity Testing for Depth 3 Circuits
We study the identity testing problem for depth 3 arithmetic circuits ( circuit). We give the first deterministic polynomial time identity test for circuits with bounded top fanin...
Neeraj Kayal, Nitin Saxena