515 search results - page 61 / 103 » Layouts of Expander Graphs |
CHI
2011
ACM
13 years 2 months ago
2011
ACM
Despite the tremendous popularity of social network sites both on the web and within enterprises, the relationship information they contain may be often incomplete or outdated. We...
NAACL
2007
14 years 5 days ago
2007
We relate the problem of finding the best application of a Synchronous ContextFree Grammar (SCFG) rule during parsing to a Markov Random Field. This representation allows us to u...
PKDD
2010
Springer
13 years 9 months ago
2010
Springer
The focus of this paper is a question answering system, where the answers are retrieved from a collection of textual documents. The system also includes automatic document summariz...
STOC
2006
ACM
14 years 11 months ago
2006
ACM
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
GD
1998
Springer
14 years 3 months ago
1998
Springer
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a ...