Sciweavers

2314 search results - page 47 / 463
» Monoids over domains
Sort
View
LICS
2005
IEEE
15 years 5 months ago
Modal Characterisation Theorems over Special Classes of Frames
We investigate model theoretic characterisations of the expressive power of modal logics in terms of bisimulation invariance. The paradigmatic result of this kind is van Benthemâ€...
Anuj Dawar, Martin Otto
CORR
2006
Springer
133views Education» more  CORR 2006»
14 years 12 months ago
IP over P2P: Enabling Self-configuring Virtual IP Networks for Grid Computing
Abstract-- Peer-to-peer (P2P) networks have mostly focused on task oriented networking, where networks are constructed for single applications, i.e. file-sharing, DNS caching, etc....
Arijit Ganguly, Abhishek Agrawal, P. Oscar Boykin,...
TC
2008
14 years 11 months ago
Self-Adaptive Configuration of Visualization Pipeline Over Wide-Area Networks
Next-generation scientific applications require the capability to visualize large archival data sets or on-going computer simulations of physical and other phenomena over wide-area...
Qishi Wu, Jinzhu Gao, Mengxia Zhu, Nageswara S. V....
TC
2008
14 years 11 months ago
Low-Complexity Bit-Parallel Square Root Computation over GF(2^{m}) for All Trinomials
In this contribution we introduce a low-complexity bit-parallel algorithm for computing square roots over binary extension fields. Our proposed method can be applied for any type ...
Francisco Rodríguez-Henríquez, Guill...
TIT
2008
90views more  TIT 2008»
14 years 11 months ago
An Improved Sphere-Packing Bound for Finite-Length Codes Over Symmetric Memoryless Channels
This paper derives an improved sphere-packing (ISP) bound for finite-length error-correcting codes whose transmission takes place over symmetric memoryless channels, and the codes...
Gil Wiechman, Igal Sason