1629 search results - page 236 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
208
click to vote
ICDE
2011
IEEE
14 years 11 months ago
2011
IEEE
— SQL is a classical and powerful tool for querying relational databases. However, it is rather hard for inexperienced users to pose SQL queries, as they are required to be proï¬...
197
click to vote
ESWS
2007
Springer
16 years 1 months ago
2007
Springer
We investigate scalable algorithms for automated composition (WSC) of Semantic Web Services. Our notion of WSC is very general: the composition semantics includes background knowl...
321
click to vote
ICDE
2008
IEEE
16 years 8 months ago
2008
IEEE
The application of frequent patterns in classification has demonstrated its power in recent studies. It often adopts a two-step approach: frequent pattern (or classification rule) ...
207
click to vote
CAIP
2007
Springer
16 years 1 months ago
2007
Springer
In the present study, a new gridding method based on continuous wavelet transform (CWT) was performed. Line profiles of x and y axis were calculated, resulting to 2 different signa...
183
click to vote
TON
2008
15 years 7 months ago
2008
Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...