5889 search results - page 864 / 1178 » Graph Layout Problems |
189
click to vote
GECCO
2005
Springer
16 years 7 days ago
2005
Springer
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
176
click to vote
PLDI
2004
ACM
16 years 4 days ago
2004
ACM
Regular path queries are a way of declaratively expressing queries on graphs as regular-expression-like patterns that are matched against paths in the graph. There are two kinds o...
194
click to vote
WABI
2001
Springer
15 years 11 months ago
2001
Springer
We describe algorithms for pattern matching and pattern learning in TOPS diagrams (formal descriptions of protein topologies). These problems can be reduced to checking for subgrap...
179
click to vote
APPROX
2006
Springer
15 years 10 months ago
2006
Springer
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
182
click to vote
SIGSOFT
1995
ACM
15 years 10 months ago
1995
ACM
The notion of a program slice, originally introduced by Mark Weiser, is a fundamental operation for addressing many software-engineering problems, including program understanding,...