1951 search results - page 298 / 391 » An algorithm for improving graph partitions |
148
click to vote
TAMC
2009
Springer
15 years 10 months ago
2009
Springer
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classified into ...
137
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
A spanner of an undirected unweighted graph is a subgraph that approximates the distance metric of the original graph with some specified accuracy. Specifically, we say H ⊆ G i...
117
click to vote
ASPDAC
2004
ACM
15 years 9 months ago
2004
ACM
Improving logic capacity by time-sharing, dynamically reconfigurable FPGAs are employed to handle designs of high complexity and functionality. In this paper, we use a novel topo...
147
click to vote
RECSYS
2009
ACM
15 years 9 months ago
2009
ACM
In this paper we present a hybrid recommendation system that combines ontological knowledge with content-extracted linguistic information, derived from pre-trained lexical graphs,...
161
click to vote
CIKM
2008
Springer
15 years 6 months ago
2008
Springer
An expert finding system allows a user to type a simple text query and retrieve names and contact information of individuals that possess the expertise expressed in the query. Thi...