Sciweavers

1830 search results - page 192 / 366
» Workshop on Graph Computation Models
Sort
View
SMA
2008
ACM
173views Solid Modeling» more  SMA 2008»
15 years 6 months ago
Visibility-based feature extraction from discrete models
In this paper, we present a new visibility-based feature extraction algorithm from discrete models as dense point clouds resulting from laser scans. Based on the observation that ...
Antoni Chica
WSDM
2010
ACM
254views Data Mining» more  WSDM 2010»
16 years 3 months ago
Learning Influence Probabilities In Social Networks
Recently, there has been tremendous interest in the phenomenon of influence propagation in social networks. The studies in this area assume they have as input to their problems a ...
Amit Goyal 0002, Francesco Bonchi, Laks V. S. Laks...
ATAL
2007
Springer
15 years 10 months ago
Workflow coordination for service-oriented multiagent systems
From a multiagent viewpoint, a workflow is a dynamic set of tasks performed by a set of agents to reach a shared goal. We show herein that commitments among agents can be used to ...
Jiangbo Dang, Jingshan Huang, Michael N. Huhns
IS
2007
15 years 6 months ago
Discovering frequent geometric subgraphs
As data mining techniques are being increasingly applied to non-traditional domains, existing approaches for finding frequent itemsets cannot be used as they cannot model the req...
Michihiro Kuramochi, George Karypis
ASM
2005
ASM
15 years 11 months ago
RAM Simulation of BGS Model of Abstract State Machines
lation of BGS model of Abstract State Machines Comandur Seshadhri1 , Anil Seth2 , and Somenath Biswas2 1 Department of Computer Science Princeton University, Princeton NJ 08544, US...
Seshadhri Comandur, Anil Seth, Somenath Biswas