Sciweavers

1998 search results - page 311 / 400
» Basic Association Rules
Sort
View

Publication
216views
12 years 8 months ago
The Geometry of Time-Stepping
The space-time geometric structure of Maxwell’s equations is examined and a subset of them is found to define a pair of exact discrete time-stepping relations. The desirability ...
Claudio Mattiussi
STACS
2007
Springer
14 years 4 months ago
Reachability in Unions of Commutative Rewriting Systems Is Decidable
We consider commutative string rewriting systems (Vector Addition Systems, Petri nets), i.e., string rewriting systems in which all pairs of letters commute. We are interested in r...
Mikolaj Bojanczyk, Piotr Hoffman
EDBT
2009
ACM
138views Database» more  EDBT 2009»
14 years 4 months ago
FOGGER: an algorithm for graph generator discovery
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...
Zhiping Zeng, Jianyong Wang, Jun Zhang, Lizhu Zhou
ATAL
2009
Springer
14 years 4 months ago
User modeling in position auctions: re-considering the GSP and VCG mechanisms
We introduce a study of position auctions, with an explicit modeling of user navigation through ads. We refer to our model as the PPA model, since it is most applicable in the con...
Danny Kuminov, Moshe Tennenholtz
WINE
2005
Springer
179views Economy» more  WINE 2005»
14 years 3 months ago
A Graph-Theoretic Network Security Game
Consider a network vulnerable to viral infection. The system security software can guarantee safety only to a limited part of the network. Such limitations result from economy cos...
Marios Mavronicolas, Vicky G. Papadopoulou, Anna P...