1402 search results - page 223 / 281 » Sparse-Memory Graph Search |
115
click to vote
DASFAA
2011
IEEE
14 years 3 months ago
2011
IEEE
Route planning, which is used to calculate feasible routes in a given environment, is one of the key issues in navigation systems. According to different constraints in different...
116
click to vote
ISBI
2011
IEEE
14 years 3 months ago
2011
IEEE
High angular resolution diffusion imaging (HARDI) allows in vivo analysis of the white matter structure and connectivity. Based on orientation distribution functions (ODFs) that r...
124
click to vote
SAC
2011
ACM
14 years 2 months ago
2011
ACM
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...
AAAI
2011
13 years 12 months ago
2011
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
118
click to vote
SIGIR
2012
ACM
13 years 2 months ago
2012
ACM
Many of the recent, and more effective, retrieval models have incorporated dependencies between the terms in the query. In this paper, we advance this query representation one st...