Sciweavers

1434 search results - page 97 / 287
» Graph Searching with Advice
Sort
View
ICWS
2008
IEEE
13 years 10 months ago
An Efficient Syntactic Web Service Composition Algorithm Based on the Planning Graph Model
In this paper, we have studied a common Web service composition problem, the syntactic matching problem, where the output parameters of a Web service can be used as the input para...
Xianrong Zheng, Yuhong Yan
CORR
2010
Springer
124views Education» more  CORR 2010»
13 years 9 months ago
Link Graph Analysis for Adult Images Classification
In order to protect an image search engine's users from undesirable results adult images' classifier should be built. The information about links from websites to images...
Evgeny Kharitonov, Anton Slesarev, Ilya Muchnik, F...
STACS
2010
Springer
14 years 3 months ago
Log-space Algorithms for Paths and Matchings in k-trees
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [14]. However, for graphs of treewidth larger than ...
Bireswar Das, Samir Datta, Prajakta Nimbhorkar
ICCS
1994
Springer
14 years 28 days ago
UDS: A Universal Data Structure
This paper gives a data structure (UDS) for supporting database retrieval, inference and machine learning that attempts to unify and extend previous work in relational databases, ...
Robert Levinson
UAI
2004
13 years 10 months ago
A Complete Anytime Algorithm for Treewidth
In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect ...
Vibhav Gogate, Rina Dechter