Sciweavers

2419 search results - page 12 / 484
» Modeling Spatio-temporal Network Computations: A Summary of ...
Sort
View
CINQ
2004
Springer
131views Database» more  CINQ 2004»
14 years 1 months ago
Model-Independent Bounding of the Supports of Boolean Formulae in Binary Data
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...
Artur Bykowski, Jouni K. Seppänen, Jaakko Hol...
WSC
2007
13 years 10 months ago
Analyzing air combat simulation results with dynamic Bayesian networks
In this paper, air combat simulation data is reconstructed into a dynamic Bayesian network. It gives a compact probabilistic model that describes the progress of air combat and al...
Jirka Poropudas, Kai Virtanen
WWW
2005
ACM
14 years 8 months ago
SemRank: ranking complex relationship search results on the semantic web
While the idea that querying mechanisms for complex relationships (otherwise known as Semantic Associations) should be integral to Semantic Web search technologies has recently ga...
Kemafor Anyanwu, Angela Maduko, Amit P. Sheth
SIGECOM
2009
ACM
112views ECommerce» more  SIGECOM 2009»
14 years 2 months ago
Network bargaining: algorithms and structural results
We consider models for bargaining in social networks, in which players are represented by vertices and edges represent bilateral opportunities for deals between pairs of players. ...
Tanmoy Chakraborty, Michael Kearns, Sanjeev Khanna
SIGMOD
2008
ACM
191views Database» more  SIGMOD 2008»
14 years 7 months ago
Efficient aggregation for graph summarization
Graphs are widely used to model real world objects and their relationships, and large graph datasets are common in many application domains. To understand the underlying character...
Yuanyuan Tian, Richard A. Hankins, Jignesh M. Pate...