Sciweavers

10997 search results - page 227 / 2200
» On the Structure of Complete Sets
Sort
View
LOGCOM
2010
102views more  LOGCOM 2010»
15 years 5 months ago
A Note on Expressive Coalgebraic Logics for Finitary Set Functors
This paper has two purposes. The first is to present a final coalgebra construction for finitary endofunctors on Set that uses a certain subset L∗ of the limit L of the firs...
Lawrence S. Moss
AIMSA
2006
Springer
15 years 10 months ago
A Formal General Setting for Dialogue Protocols
Abstract. In this paper, we propose a general and abstract formal setting for argumentative dialogue protocols. We identify a minimal set of basic parameters that characterize dial...
Leila Amgoud, Sihem Belabbes, Henri Prade
MASCOTS
2007
15 years 8 months ago
A Hierarchical Connected Dominating Set Based Clustering Algorithm for Mobile Ad Hoc Networks
— We propose a hierarchical Connected Dominating Set (CDS) based algorithm for clustering in Mobile Ad hoc Networks (MANETs). Our algorithm is an extension of our previous Connec...
Deniz Cokuslu, Kayhan Erciyes
IACR
2011
101views more  IACR 2011»
14 years 6 months ago
Policy-Enhanced Private Set Intersection: Sharing Information While Enforcing Privacy Policies
Companies, organizations, and individuals often wish to share information to realize valuable social and economic goals. Unfortunately, privacy concerns often stand in the way of ...
Emil Stefanov, Elaine Shi, Dawn Song
ICC
2011
IEEE
217views Communications» more  ICC 2011»
14 years 6 months ago
Controlling LDPC Absorbing Sets via the Null Space of the Cycle Consistency Matrix
— This paper focuses on controlling absorbing sets for a class of regular LDPC codes, known as separable, circulantbased (SCB) codes. For a specified circulant matrix, SCB codes...
Jiadong Wang, Lara Dolecek, Richard D. Wesel