Sciweavers

359 search results - page 6 / 72
» On the number of chord diagrams
Sort
View
SIAMDM
2010
194views more  SIAMDM 2010»
13 years 2 months ago
Combinatorics and Geometry of Finite and Infinite Squaregraphs
Abstract. Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not in...
Hans-Jürgen Bandelt, Victor Chepoi, David Epp...
ISCAS
2003
IEEE
122views Hardware» more  ISCAS 2003»
14 years 22 days ago
Reducing the number of variable movements in exact BDD minimization
Ordered Binary Decision Diagrams (BDDs) are frequently used in logic synthesis. In this paper a new exact BDD minimization algorithm is presented, which is based on state space se...
Rüdiger Ebendt
ENTCS
2006
174views more  ENTCS 2006»
13 years 7 months ago
Symbolic Reasoning with Weighted and Normalized Decision Diagrams
Several variants of Bryant's ordered binary decision diagrams have been suggested in the literature to reason about discrete functions. In this paper, we introduce a generic ...
Jörn Ossowski, Christel Baier
ISCC
2009
IEEE
262views Communications» more  ISCC 2009»
14 years 2 months ago
Babelchord: a social tower of DHT-based overlay networks
Chord is a protocol to distribute and retrieve information at large scale. It builds a large but rigid overlay network without taking into account the social nature and the underl...
Luigi Liquori, Cédric Tedeschi, Francesco B...
ICC
2011
IEEE
236views Communications» more  ICC 2011»
12 years 7 months ago
0 to 10k in 20 Seconds: Bootstrapping Large-Scale DHT Networks
—A handful of proposals address the problem of bootstrapping a large DHT network from scratch, but they all forgo the standard DHT join protocols in favor of their own distribute...
Jae Woo Lee, Henning Schulzrinne, Wolfgang Kellere...