Sciweavers

2907 search results - page 36 / 582
» Presentations of Structures in Admissible Sets
Sort
View
MOBIHOC
2002
ACM
14 years 8 months ago
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
Yuanzhu Peter Chen, Arthur L. Liestman
AIMSA
2006
Springer
14 years 7 days 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
ICC
2011
IEEE
217views Communications» more  ICC 2011»
12 years 8 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
ISBI
2004
IEEE
14 years 9 months ago
Combining Fuzzy Logic and Level Set Methods for 3D MRI Brain Segmentation
We propose to segment volumetric brain structures with a level set method including a fuzzy decision in the design of the evolution force. The role of fuzzy logic is to fuse gradi...
Christian Barillot, Cybèle Ciofolo, Pierre ...
SASP
2009
IEEE
222views Hardware» more  SASP 2009»
14 years 3 months ago
Arithmetic optimization for custom instruction set synthesis
Abstract—One of the ways that custom instruction set extensions can improve over software execution is through the use of hardware structures that have been optimized at the arit...
Ajay K. Verma, Yi Zhu, Philip Brisk, Paolo Ienne