Sciweavers

4926 search results - page 283 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
ASM
2008
ASM
15 years 8 months ago
On the Purpose of Event-B Proof Obligations
Event-B is a formal modelling method which is claimed to be suitable for diverse modelling domains, such as reactive systems and sequential program development. This claim hinges o...
Stefan Hallerstede
JMLR
2006
118views more  JMLR 2006»
15 years 6 months ago
Learning Factor Graphs in Polynomial Time and Sample Complexity
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...
Pieter Abbeel, Daphne Koller, Andrew Y. Ng
DATAMINE
2010
175views more  DATAMINE 2010»
15 years 6 months ago
Extracting influential nodes on a social network for information diffusion
We address the combinatorial optimization problem of finding the most influential nodes on a large-scale social network for two widely-used fundamental stochastic diffusion models...
Masahiro Kimura, Kazumi Saito, Ryohei Nakano, Hiro...
ICMT
2009
Springer
16 years 20 days ago
Pattern-Based Model-to-Model Transformation: Handling Attribute Conditions
Abstract. Pattern-based model-to-model transformation is a new approach for specifying transformations in a declarative, relational and formal style. The language relies on pattern...
Esther Guerra, Juan de Lara, Fernando Orejas
CVPR
2008
IEEE
15 years 8 months ago
A rank constrained continuous formulation of multi-frame multi-target tracking problem
This paper presents a multi-frame data association algorithm for tracking multiple targets in video sequences. Multi-frame data association involves finding the most probable corr...
Khurram Shafique, Mun Wai Lee, Niels Haering