Sciweavers

332 search results - page 55 / 67
» Complexity analysis of a decentralised graph colouring algor...
Sort
View
COCOON
2001
Springer
15 years 4 months ago
PC-Trees vs. PQ-Trees
A data structure called PC-tree is introduced as a generalization of PQ-trees. PC-trees were originally introduced in a planarity test of Shih and Hsu [7] where they represent par...
Wen-Lian Hsu
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
15 years 12 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
126
Voted
CORR
2011
Springer
174views Education» more  CORR 2011»
14 years 3 months ago
Parameter Learning of Logic Programs for Symbolic-Statistical Modeling
We propose a logical/mathematical framework for statistical parameter learning of parameterized logic programs, i.e. de nite clause programs containing probabilistic facts with a ...
Yoshitaka Kameya, Taisuke Sato
97
Voted
ICASSP
2011
IEEE
14 years 3 months ago
Sparse graphical modeling of piecewise-stationary time series
Graphical models are useful for capturing interdependencies of statistical variables in various fields. Estimating parameters describing sparse graphical models of stationary mul...
Daniele Angelosante, Georgios B. Giannakis
DAC
2006
ACM
16 years 19 days ago
Criticality computation in parameterized statistical timing
Chips manufactured in 90 nm technology have shown large parametric variations, and a worsening trend is predicted. These parametric variations make circuit optimization difficult ...
Jinjun Xiong, Vladimir Zolotov, Natesan Venkateswa...