4171 search results - page 106 / 835 » Choice numbers of graphs |
148
click to vote
ACL
1998
15 years 7 months ago
1998
Word graphs are able to represent a large number of different utterance hypotheses in a very compact manner. However, usually they contain a huge amount of redundancy in terms of ...
168
click to vote
ACL
2004
15 years 7 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...
160
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
Most of recommender systems try to find items that are most relevant to the older choices of a given user. Here we focus on the "surprise me" query: A user may be bored ...
154
click to vote
COMBINATORICA
2008
15 years 6 months ago
2008
We show that if a graph G has the property that all subsets of vertices of size n/4 contain the "correct" number of triangles one would expect to find in a random graph ...
163
click to vote
DAM
2008
15 years 6 months ago
2008
We present a polynomial time algorithm to compute a minimum (weight) feedback vertex set for AT-free graphs, and extending this approach we obtain a polynomial time algorithm for ...