Sciweavers

211 search results - page 29 / 43
» Counting the number of independent sets in chordal graphs
Sort
View
ICCV
2005
IEEE
14 years 1 months ago
Robust Point Matching for Two-Dimensional Nonrigid Shapes
Recently, nonrigid shape matching has received more and more attention. For nonrigid shapes, most neighboring points cannot move independently under deformation due to physical co...
Yefeng Zheng, David S. Doermann
PODC
2005
ACM
14 years 1 months ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
CORR
2008
Springer
129views Education» more  CORR 2008»
13 years 7 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
VLSID
2004
IEEE
292views VLSI» more  VLSID 2004»
14 years 8 months ago
NoCGEN: A Template Based Reuse Methodology for Networks on Chip Architecture
In this paper, we describe NoCGEN, a Network On Chip (NoC) generator, which is used to create a simulatable and synthesizable NoC description. NoCGEN uses a set of modularised rou...
Jeremy Chan, Sri Parameswaran
WINE
2005
Springer
179views Economy» more  WINE 2005»
14 years 1 months ago
A Graph-Theoretic Network Security Game
Consider a network vulnerable to viral infection. The system security software can guarantee safety only to a limited part of the network. Such limitations result from economy cos...
Marios Mavronicolas, Vicky G. Papadopoulou, Anna P...