4926 search results - page 191 / 986 » Two Graph Algorithms On an Associative Computing Model |
212
click to vote
IJCV
2006
15 years 7 months ago
2006
Object recognition can be formulated as matching image features to model features. When recognition is exemplar-based, feature correspondence is one-to-one. However, segmentation e...
166
Voted
COCO
2007
Springer
16 years 1 months ago
2007
Springer
We make progress in understanding the complexity of the graph reachability problem in the context of unambiguous logarithmic space computation; a restricted form of nondeterminism....
204
Voted
TIT
2010
15 years 1 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...
187
click to vote
PARA
2004
Springer
16 years 9 days ago
2004
Springer
We describe the parallelization of an efficient algorithm for balanced truncation that allows to reduce models with state-space dimension up to O(105 ). The major computational tas...
181
click to vote
RECOMB
2005
Springer
16 years 7 months ago
2005
Springer
Abstract. The interpretation of large-scale protein network data depends on our ability to identify significant sub-structures in the data, a computationally intensive task. Here w...