Sciweavers

2414 search results - page 230 / 483
» Computing Normal Subgroups
Sort
View
EXACT
2007
14 years 22 days ago
Learning Models from Temporal-Logic Properties via Explanations
Given a model and a property expressed in temporal logic, a model checker normally produces a counterexample in case the model does not satisfy the property. This counterexample i...
Miguel A. Carrillo, David A. Rosenblueth
AINA
2008
IEEE
14 years 12 days ago
Formalization of Link Farm Structure Using Graph Grammar
A link farm is a set of web pages constructed to mislead the importance of target pages in search engine results by boosting their link-based ranking scores. In this paper, we int...
Kiattikun Chobtham, Athasit Surarerks, Arnon Rungs...
FLAIRS
2003
13 years 11 months ago
An Extension of the Differential Approach for Bayesian Network Inference to Dynamic Bayesian Networks
We extend the differential approach to inference in Bayesian networks (BNs) (Darwiche, 2000) to handle specific problems that arise in the context of dynamic Bayesian networks (D...
Boris Brandherm
SDM
2004
SIAM
229views Data Mining» more  SDM 2004»
13 years 11 months ago
R-MAT: A Recursive Model for Graph Mining
How does a `normal' computer (or social) network look like? How can we spot `abnormal' sub-networks in the Internet, or web graph? The answer to such questions is vital ...
Deepayan Chakrabarti, Yiping Zhan, Christos Falout...
GG
2008
Springer
13 years 11 months ago
High-Level Programs and Program Conditions
High-level conditions are well-suited for expressing structural properties. They can describe the precondition and the postcondition for a high-level program, but they cannot descr...
Karl Azab, Annegret Habel