6598 search results - page 360 / 1320 » Graph Theory with Applications |
194
click to vote
POPL
2012
ACM
14 years 2 months ago
2012
ACM
This paper describes an executable formal semantics of C. Being executable, the semantics has been thoroughly tested against the GCC torture test suite and successfully passes 99....
195
click to vote
SAC
2012
ACM
14 years 2 months ago
2012
ACM
Data cloning method is a new computational tool for computing maximum likelihood estimates in complex statistical models such as mixed models. This method is synthesized with inte...
197
click to vote
KDD
2005
ACM
16 years 7 months ago
2005
ACM
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
280
click to vote
VLDB
2007
ACM
16 years 7 months ago
2007
ACM
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
265
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
With ever-increasing amounts of graph data from disparate sources, there has been a strong need for exploiting significant graph patterns with user-specified objective functions. ...