Sciweavers

439 search results - page 73 / 88
» Choiceless Computation and Symmetry
Sort
View
87
Voted
ASM
2008
ASM
14 years 11 months ago
The High Road to Formal Validation:
Abstract. In this paper we examine the difference between model checking high-level and low-level models. In particular, we compare the ProB model checker for the B-method and the ...
Michael Leuschel
CVPR
2010
IEEE
14 years 10 months ago
Deconvolutional networks
Building robust low and mid-level image representations, beyond edge primitives, is a long-standing goal in vision. Many existing feature detectors spatially pool edge information...
Matthew D. Zeiler, Dilip Krishnan, Graham W. Taylo...
CG
2002
Springer
14 years 9 months ago
New Winning and Losing Positions for 7x7 HEx
Abstract. In this paper, we applied the decomposition method to obtain a new winning strategy for 7x7 Hex. We also found that some positions on the 7x7 Hex board, called trivial po...
Jing Yang, Simon X. Liao, Miroslaw Pawlak
NPL
2000
99views more  NPL 2000»
14 years 9 months ago
On the Internal Representations of Product Units
This paper explores internal representation power of product units [1] that act as the functional nodes in the hidden layer of a multi-layer feedforward network. Interesting proper...
Jung-Hua Wang, Yi-Wei Yu, Jia-Horng Tsai
JSS
1998
90views more  JSS 1998»
14 years 9 months ago
A taxonomy of distributed termination detection algorithms
An important problem in the ®eld of distributed systems is that of detecting the termination of a distributed computation. Distributed termination detection (DTD) is a dicult p...
Jeff Matocha, Tracy Camp