Sciweavers

214 search results - page 43 / 43
» Foundations of probabilistic answers to queries
Sort
View
CCS
2004
ACM
13 years 10 months ago
Payload attribution via hierarchical bloom filters
Payload attribution is an important problem often encountered in network forensics. Given an excerpt of a payload, finding its source and destination is useful for many security ...
Kulesh Shanmugasundaram, Hervé Brönnim...
SODA
2004
ACM
121views Algorithms» more  SODA 2004»
13 years 6 months ago
A characterization of easily testable induced subgraphs
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
Noga Alon, Asaf Shapira
ICPP
2006
IEEE
13 years 11 months ago
A Formal Analysis of Space Filling Curves for Parallel Domain Decomposition
Space filling curves (SFCs) are widely used for parallel domain decomposition in scientific computing applications. The proximity preserving properties of SFCs are expected to k...
Srikanta Tirthapura, Sudip Seal, Srinivas Aluru
ATAL
2010
Springer
13 years 6 months ago
History-dependent graphical multiagent models
A dynamic model of a multiagent system defines a probability distribution over possible system behaviors over time. Alternative representations for such models present tradeoffs i...
Quang Duong, Michael P. Wellman, Satinder P. Singh...