Sciweavers

1648 search results - page 176 / 330
» On the generation of bicliques of a graph
Sort
View
TCAD
2008
97views more  TCAD 2008»
13 years 9 months ago
Encoding Large Asynchronous Controllers With ILP Techniques
State encoding is one of the most difficult problems in the synthesis of asynchronous controllers. This paper presents a method that can solve the problem of large controllers spec...
Josep Carmona, Jordi Cortadella
TIT
2008
129views more  TIT 2008»
13 years 9 months ago
Serial Schedules for Belief-Propagation: Analysis of Convergence Time
Abstract--Low-Density Parity-Check (LDPC) codes are usually decoded by running an iterative belief-propagation algorithm over the factor graph of the code. In the traditional messa...
Jacob Goldberger, Haggai Kfir
IJAR
2010
152views more  IJAR 2010»
13 years 7 months ago
Structural-EM for learning PDG models from incomplete data
Probabilistic Decision Graphs (PDGs) are a class of graphical models that can naturally encode some context specific independencies that cannot always be efficiently captured by...
Jens D. Nielsen, Rafael Rumí, Antonio Salme...
FCS
2009
13 years 6 months ago
Circuits as a Classifier for Small-World Network Models
The number and length distribution of circuits or loops in a graph or network give important insights into its key characteristics. We discuss the circuit properties of various sm...
Arno Leist, Kenneth A. Hawick
HCI
2009
13 years 6 months ago
Interactive Object Segmentation System from a Video Sequence
In this paper, we present an interactive object segmentation system form video, such as TV products and films, for converting 2D to 3D contents. It is focused on reducing the proce...
Guntae Bae, Soo Yeong Kwak, Hyeran Byun