1402 search results - page 207 / 281 » Searching Cycle-Disjoint Graphs |
132
click to vote
SAC
2011
ACM
14 years 3 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 ...
110
Voted
AAAI
2011
14 years 21 days 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...
127
click to vote
SIGIR
2012
ACM
13 years 3 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...
108
Voted
WWW
2007
ACM
16 years 1 months ago
2007
ACM
A minimal perfect function maps a static set of keys on to the range of integers {0,1,2, ... , - 1}. We present a scalable high performance algorithm based on random graphs for ...
133
Voted
CVPR
2001
IEEE
16 years 2 months ago
2001
IEEE
Perceptual popout is defined by both feature similarity and local feature contrast. We identify these two measures with attraction and repulsion, and unify the dual processes of a...