1729 search results - page 256 / 346 » Bound Graph Polysemy |
166
click to vote
TIT
2010
14 years 11 months ago
2010
We present a novel framework to estimate protein-protein (PPI) and domain-domain (DDI) interactions based on a belief propagation estimation method that efficiently computes inter...
148
Voted
TOG
2010
14 years 11 months ago
2010
Large corpora of 3D models, such as Google 3D Warehouse, are now becoming available on the web. It is possible to search these databases using a keyword search. This makes it poss...
163
click to vote
CVPR
2011
IEEE
14 years 8 months ago
2011
IEEE
We propose a new objective function for superpixel segmentation. This objective function consists of two components: entropy rate of a random walk on a graph and a balancing term....
191
click to vote
CVPR
2012
IEEE
13 years 7 months ago
2012
IEEE
A greedy-based approach to learn a compact and discriminative dictionary for sparse representation is presented. We propose an objective function consisting of two components: ent...
142
Voted
AI
2007
Springer
15 years 5 months ago
2007
Springer
One difficulty that arises in abstract argument systems is that many natural questions regarding argument acceptability are, in general, computationally intractable having been c...