9532 search results - page 308 / 1907 » Logic, Graphs, and Algorithms |
168
click to vote
AAAI
2007
15 years 9 months ago
2007
We describe a novel approach to parallelizing graph search using structured duplicate detection. Structured duplicate detection was originally developed as an approach to external...
155
click to vote
ACL
1998
15 years 8 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 ...
182
click to vote
WEA
2009
Springer
16 years 1 months ago
2009
Springer
What does it mean for two geometric graphs to be similar? We propose a distance for geometric graphs that we show to be a metric, and that can be computed by solving an integer li...
149
click to vote
MFCS
2007
Springer
16 years 24 days ago
2007
Springer
Abstract. We present algorithmic lower bounds on the size of the largest independent sets of vertices in a random d-regular graph. Our bounds hold with probability approaching one ...
123
click to vote
SODA
2003
ACM
15 years 8 months ago
2003
ACM
We consider the problem of representing graphs compactly while supporting queries efficiently. In particular we describe a data structure for representing n-vertex unlabeled graph...