1629 search results - page 236 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
ICDE
2011
IEEE
14 years 1 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ï¬...
ESWS
2007
Springer
15 years 4 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...
185
click to vote
ICDE
2008
IEEE
15 years 11 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) ...
CAIP
2007
Springer
15 years 4 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...
TON
2008
14 years 9 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...