Sciweavers

1067 search results - page 107 / 214
» Probabilistic regular graphs
Sort
View
EGH
2009
Springer
15 years 29 days ago
Fast minimum spanning tree for large graphs on the GPU
Graphics Processor Units are used for many general purpose processing due to high compute power available on them. Regular, data-parallel algorithms map well to the SIMD architect...
Vibhav Vineet, Pawan Harish, Suryakant Patidar, P....
EMNLP
2008
15 years 4 months ago
Sampling Alignment Structure under a Bayesian Translation Model
We describe the first tractable Gibbs sampling procedure for estimating phrase pair frequencies under a probabilistic model of phrase alignment. We propose and evaluate two nonpar...
John DeNero, Alexandre Bouchard-Côté,...
129
Voted
IJWGS
2006
125views more  IJWGS 2006»
15 years 3 months ago
Compiling business processes: untangling unstructured loops in irreducible flow graphs
: This paper presents a systematic study of some major problems involved in the transformation of business process modelling languages to executable business process representation...
Wei Zhao, Rainer Hauser, Kamal Bhattacharya, Barre...
91
Voted
ICPR
2008
IEEE
16 years 4 months ago
Object localization using affine invariant substructure constraints
In this paper we propose a novel method for generic object localization. The method is based on modeling the object as a graph at two levels: a local substructural representation ...
Ahmed M. Elgammal, Ishani Chakraborty
ODBIS
2007
Springer
157views Database» more  ODBIS 2007»
15 years 9 months ago
An Extension of SPARQL for RDFS
Abstract. RDF Schema (RDFS) extends RDF with a schema vocabulary with a predefined semantics. Evaluating queries which involve this vocabulary is challenging, and there is not yet...
Marcelo Arenas, Claudio Gutierrez, Jorge Pé...