Sciweavers

3265 search results - page 237 / 653
» Representing Groups on Graphs
Sort
View
RTA
2010
Springer
15 years 8 months ago
Closing the Gap Between Runtime Complexity and Polytime Computability
In earlier work, we have shown that for confluent term rewrite systems (TRSs for short), innermost polynomial runtime complexity induces polytime computability of the functions de...
Martin Avanzini, Georg Moser
IAT
2009
IEEE
15 years 8 months ago
Efficient Distributed Bayesian Reasoning via Targeted Instantiation of Variables
Abstract--This paper is focusing on exact Bayesian reasoning in systems of agents, which represent weakly coupled processing modules supporting collaborative inference through mess...
Patrick de Oude, Gregor Pavlin
APPROX
2006
Springer
117views Algorithms» more  APPROX 2006»
15 years 8 months ago
Fractional Matching Via Balls-and-Bins
In this paper we relate the problem of finding structures related to perfect matchings in bipartite graphs to a stochastic process similar to throwing balls into bins. Given a bip...
Rajeev Motwani, Rina Panigrahy, Ying Xu 0002
ACL
2006
15 years 6 months ago
Relation Extraction Using Label Propagation Based Semi-Supervised Learning
Shortage of manually labeled data is an obstacle to supervised relation extraction methods. In this paper we investigate a graph based semi-supervised learning algorithm, a label ...
Jinxiu Chen, Dong-Hong Ji, Chew Lim Tan, Zheng-Yu ...
BMVC
2000
15 years 6 months ago
Region-Based Object Recognition: Pruning Multiple Representations and Hypotheses
We address the problem of object recognition in computer vision. We represent each model and the scene in the form of Attributed Relational Graph. A multiple region representation...
Alireza Ahmadyfard, Josef Kittler