1060 search results - page 166 / 212 » On the Discovery of Random Trees |
157
click to vote
ECML
2007
Springer
16 years 9 days ago
2007
Springer
Abstract. Existing relational learning approaches usually work on complete relational data, but real-world data are often incomplete. This paper proposes the MGDA approach to learn...
107
click to vote
ICRA
2006
IEEE
16 years 5 days ago
2006
IEEE
— This paper addresses the problem of maneuvering an object by pushing it through an environment with obstacles. Instead of only pushing the object through open spaces, we also a...
171
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
We introduce the notion of hierarchical group signatures. This is a proper generalization of group signatures, which allows multiple group managers organized in a tree with the si...
170
click to vote
PPAM
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...
164
click to vote
ESA
2004
Springer
15 years 11 months ago
2004
Springer
We obtain the following results related to dynamic versions of the shortest-paths problem: (i) Reductions that show that the incremental and decremental singlesource shortest-paths...