Sciweavers

89 search results - page 17 / 18
» Topological Persistence and Simplification
Sort
View
DCG
2010
104views more  DCG 2010»
13 years 5 months ago
Vietoris-Rips Complexes of Planar Point Sets
Fix a finite set of points in Euclidean n-space En , thought of as a point-cloud sampling of a certain domain D En . The VietorisRips complex is a combinatorial simplicial complex...
Erin W. Chambers, Vin de Silva, Jeff Erickson, Rob...
SSD
2005
Springer
145views Database» more  SSD 2005»
14 years 1 months ago
High Performance Multimodal Networks
Networks often form the core of many users’ spatial databases. Networks are used to support the rapid navigation and analysis of linearly connected data such as that found in tra...
Erik G. Hoel, Wee-Liang Heng, Dale Honeycutt
AINA
2009
IEEE
14 years 2 months ago
Similarity Search over DNS Query Streams for Email Worm Detection
Email worms continue to be a persistent problem, indicating that current approaches against this class of selfpropagating malicious code yield rather meagre results. Additionally,...
Nikolaos Chatzis, Nevil Brownlee
VIZSEC
2007
Springer
14 years 1 months ago
An Interactive Attack Graph Cascade and Reachability Display
Abstract Attack graphs for large enterprise networks improve security by revealing critical paths used by adversaries to capture network assets. Even with simplification, current a...
Leevar Williams, Richard Lippmann, Kyle Ingols
JAIR
2006
90views more  JAIR 2006»
13 years 7 months ago
Engineering Benchmarks for Planning: the Domains Used in the Deterministic Part of IPC-4
In a field of research about general reasoning mechanisms, it is essential to have appropriate benchmarks. Ideally, the benchmarks should reflect possible applications of the deve...
Jörg Hoffmann, Stefan Edelkamp, Sylvie Thi&ea...