Sciweavers

653 search results - page 44 / 131
» The size of minimum 3-trees
Sort
View
GLOBECOM
2006
IEEE
16 years 8 days ago
Protograph LDPC Codes with Node Degrees at Least 3
— In this paper we present protograph codes with a small number of degree-3 nodes and one high degree node. The iterative decoding threshold for proposed rate 1/2 codes are lower...
Dariush Divsalar, Christopher Jones
142
Voted
ICDCIT
2005
Springer
15 years 11 months ago
Cleaning an Arbitrary Regular Network with Mobile Agents
In this paper, we consider a contaminated network with an intruder. The task for the mobile agents is to decontaminate all hosts while preventing a recontamination and to do so as ...
Paola Flocchini, Amiya Nayak, Arno Schulz
ISAAC
2004
Springer
207views Algorithms» more  ISAAC 2004»
15 years 11 months ago
Pareto Optimality in House Allocation Problems
We study Pareto optimal matchings in the context of house allocation problems. We present an O( √ nm) algorithm, based on Gale’s Top Trading Cycles Method, for finding a maxim...
David J. Abraham, Katarína Cechlárov...
DMIN
2006
109views Data Mining» more  DMIN 2006»
15 years 7 months ago
Revised Aggregation-tree Used in Metadata Extraction from SVG Images
Many of the multimedia researchers have focused on the issue of the retrieval of images using indexed image collections. A number of spatial data structures based on Minimum Bound...
Shuju Bai, Abdus Salam, Ebrahim Khosravi
175
Voted
JCSS
2008
96views more  JCSS 2008»
15 years 6 months ago
A combinatorial characterization of resolution width
We provide a characterization of the resolution width introduced in the context of propositional proof complexity in terms of the existential pebble game introduced in the context...
Albert Atserias, Víctor Dalmau