1629 search results - page 240 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
SAC
2008
ACM
14 years 9 months ago
2008
ACM
Modern applications requiring spatial network processing pose many interesting query optimization challenges. In many cases, query processing depends on the corresponding graph si...
108
click to vote
SIGMOD
2004
ACM
15 years 10 months ago
2004
ACM
Schema matching identifies elements of two given schemas that correspond to each other. Although there are many algorithms for schema matching, little has been written about build...
GLVLSI
2010
IEEE
15 years 3 months ago
2010
IEEE
Clock skew variations adversely affect timing margins, limiting performance, reducing yield, and may also lead to functional faults. Non-tree clock distribution networks, such as ...
107
click to vote
CIKM
2010
Springer
14 years 8 months ago
2010
Springer
Query recommendation has been recognized as an important mean to help users search and also improve the usability of search engines. Existing approaches mainly focus on helping us...
104
click to vote
ICCAD
1999
IEEE
15 years 2 months ago
1999
IEEE
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...