463 search results - page 32 / 93 » A General Framework for Graph Sparsification |
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
In this paper, we study the problem of nonnegative graph
embedding, originally investigated in [14] for reaping the
benefits from both nonnegative data factorization and the
spe...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic second-order, a natural extension of monoadic second-order logic), and t...
ICFP
2008
ACM
14 years 7 months ago
2008
ACM
Optimal path queries are queries to obtain an optimal path specified by a given criterion of optimality. There have been many studies to give efficient algorithms for classes of o...
EMNLP
2007
13 years 9 months ago
2007
Shallow semantic parsing, the automatic identification and labeling of sentential constituents, has recently received much attention. Our work examines whether semantic role info...
ACL
2004
13 years 9 months ago
2004
We describe a method for enriching the output of a parser with information available in a corpus. The method is based on graph rewriting using memorybased learning, applied to dep...