Sciweavers

288 search results - page 36 / 58
» On the number of maximal independent sets in a graph
Sort
View
CORR
2008
Springer
129views Education» more  CORR 2008»
14 years 10 months ago
Linear Time Encoding of LDPC Codes
Abstract--In this paper, we propose a linear complexity encoding method for arbitrary LDPC codes. We start from a simple graph-based encoding method "label-and-decide." W...
Jin Lu, José M. F. Moura
FSTTCS
2008
Springer
14 years 11 months ago
Pruning 2-Connected Graphs
Given an edge-weighted undirected graph G with a specified set of terminals, let the density of any subgraph be the ratio of its weight/cost to the number of terminals it contain...
Chandra Chekuri, Nitish Korula
COCOON
2005
Springer
15 years 3 months ago
Genome Rearrangements with Partially Ordered Chromosomes
Genomic maps often do not specify the order within some groups of two or more markers. The synthesis of a master map from several sources introduces additional order ambiguity due ...
Chunfang Zheng, David Sankoff
SIROCCO
2007
14 years 11 months ago
Why Robots Need Maps
Abstract. A large group of autonomous, mobile entities e.g. robots initially placed at some arbitrary node of the graph has to jointly visit all nodes (not necessarily all edges) a...
Miroslaw Dynia, Jakub Lopuszanski, Christian Schin...
DATE
2009
IEEE
102views Hardware» more  DATE 2009»
15 years 4 months ago
Register placement for high-performance circuits
—In modern sub-micron design, achieving low-skew clock distributions is facing challenges for high-performance circuits. Symmetric global clock distribution and clock tree synthe...
Mei-Fang Chiang, Takumi Okamoto, Takeshi Yoshimura