13026 search results - page 303 / 2606 » Probabilistic Relational Models |
142
click to vote
WWW
2007
ACM
16 years 5 months ago
2007
ACM
Service discovery is one of challenging issues in Service-Oriented computing. Currently, most of the existing service discovering and matching approaches are based on keywords-bas...
128
click to vote
KDD
2003
ACM
16 years 4 months ago
2003
ACM
Classification is a well-established operation in text mining. Given a set of labels A and a set DA of training documents tagged with these labels, a classifier learns to assign l...
201
click to vote
SIGMOD
2005
ACM
16 years 4 months ago
2005
ACM
One of the most common operations in analytic query processing is the application of an aggregate function to the result of a relational join. We describe an algorithm for computi...
128
click to vote
APPROX
2004
Springer
15 years 9 months ago
2004
Springer
While it is exponentially unlikely that a sparse random graph or hypergraph is connected, with probability 1 − o(1) such a graph has a “giant component” that, given its numbe...
118
click to vote
ICRA
2003
IEEE
15 years 9 months ago
2003
IEEE
Probabilistic roadmap (PRM) planners have been successful in path planning of robots with many degrees of freedom, but narrow passages in a robot’s configuration space create s...