1722 search results - page 162 / 345 » On the sample mean of graphs |
169
click to vote
PPSN
1992
Springer
15 years 10 months ago
1992
Springer
This paper introduces a new optimization technique called hyperplane annealing. It is similar to the mean field annealing approach to combinatorial optimization. Both annealing te...
201
click to vote
TMC
2011
15 years 1 months ago
2011
—We propose a method to compute a probably approximately correct (PAC) normalized histogram of observations with a refresh rate of Âð1Þ time units per histogram sample on a ra...
174
click to vote
CASC
2007
Springer
16 years 19 days ago
2007
Springer
For graphs there exist highly elaborated drawing algorithms. We concentrate here in an analogous way on visualizing relations represented as Boolean matrices as, e.g., in RelView. ...
174
click to vote
APN
2006
Springer
15 years 10 months ago
2006
Springer
A netchart is basically a Petri net whose places are located at some process and whose transitions are labeled by message sequence charts (MSCs). Two recent papers showed independe...
168
click to vote
ACL
2006
15 years 7 months ago
2006
We introduce the possibility of combining lexical association measures and present empirical results of several methods employed in automatic collocation extraction. First, we pre...