1538 search results - page 138 / 308 » Spectral Techniques in Graph Algorithms |
229
click to vote
ICDE
2008
IEEE
16 years 2 months ago
2008
IEEE
Given a record set D and a query score function F, a top-k query returns k records from D, whose values of function F on their attributes are the highest. In this paper, we investi...
171
click to vote
BMCBI
2007
15 years 1 months ago
2007
Background: Detecting groups of functionally related proteins from their amino acid sequence alone has been a long-standing challenge in computational genome research. Several clu...
103
click to vote
STACS
2010
Springer
15 years 8 months ago
2010
Springer
We present a method for reducing the treewidth of a graph while preserving all the minimal s−t separators. This technique turns out to be very useful in the design of parameteriz...
DAC
2006
ACM
16 years 2 months ago
2006
ACM
Simulation and verification using electronic design automation (EDA) tools are key steps in the design process for communication and signal processing systems. The synchronous dat...
111
click to vote
DIALM
2005
ACM
15 years 3 months ago
2005
ACM
Geographic face routing algorithms have been widely studied in the literature [1, 8, 13]. All face routing algorithms rely on two primitives: planarization and face traversal. The...