1002 search results - page 61 / 201 » Towards Graph Programs for Graph Algorithms |
102
click to vote
ICASSP
2008
IEEE
15 years 9 months ago
2008
IEEE
In the symbol recognition stage of online handwritten math expression recognition, the one-pass dynamic programming algorithm can produce high-quality symbol graphs in addition of...
121
click to vote
LICS
1994
IEEE
15 years 6 months ago
1994
IEEE
abstract semantics for concurrent graph reduction ALAN JEFFREY This paper presents a fully abstract semantics for a variant of the untyped -calculus with recursive declarations. We...
139
Voted
ICML
2008
IEEE
16 years 3 months ago
2008
IEEE
Graph transduction methods label input data by learning a classification function that is regularized to exhibit smoothness along a graph over labeled and unlabeled samples. In pr...
120
Voted
ESOP
2009
Springer
15 years 6 months ago
2009
Springer
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
121
click to vote
STOC
1998
ACM
15 years 6 months ago
1998
ACM
In [6], Gallager introduces a family of codes based on sparse bipartite graphs, which he calls low-density parity-check codes. He suggests a natural decoding algorithm for these c...