1729 search results - page 240 / 346 » Bound Graph Polysemy |
219
click to vote
SDM
2012
SIAM
13 years 8 months ago
2012
SIAM
Multiple data sources containing different types of features may be available for a given task. For instance, users’ profiles can be used to build recommendation systems. In a...
163
click to vote
FOCS
2009
IEEE
16 years 25 days ago
2009
IEEE
— We present new combinatorial algorithms for Boolean matrix multiplication (BMM) and preprocessing a graph to answer independent set queries. We give the first asymptotic impro...
169
click to vote
CSR
2009
Springer
16 years 20 days ago
2009
Springer
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σp 2 . In the case of linear matroids, which are represented over poly...
157
click to vote
EVOW
2007
Springer
16 years 7 days ago
2007
Springer
Many instances of NP-hard problems can be solved efficiently if the treewidth of their corresponding graph is small. Finding the optimal tree decompositions is an NP-hard problem a...
125
click to vote
ICRA
2003
IEEE
15 years 11 months ago
2003
IEEE
This paper presents an algorithm, called PCG, for planning the foothold positions of spider-like robots in planar tunnels bounded by piecewise linear walls. The paper focuses on 3-...