Sciweavers

2304 search results - page 251 / 461
» On the Vulnerability of Large Graphs
Sort
View
CIKM
2010
Springer
15 years 4 months ago
Discovery of numerous specific topics via term co-occurrence analysis
We describe efficient techniques for construction of large term co-occurrence graphs, and investigate an application to the discovery of numerous fine-grained (specific) topics. A...
Omid Madani, Jiye Yu
TOG
2010
181views more  TOG 2010»
15 years 1 months ago
Context-based search for 3D models
Large corpora of 3D models, such as Google 3D Warehouse, are now becoming available on the web. It is possible to search these databases using a keyword search. This makes it poss...
Matthew Fisher, Pat Hanrahan
PODS
2005
ACM
136views Database» more  PODS 2005»
16 years 6 months ago
Context-sensitive program analysis as database queries
Program analysis has been increasingly used in software engineering tasks such as auditing programs for security vulnerabilities and finding errors in general. Such tools often re...
Monica S. Lam, John Whaley, V. Benjamin Livshits, ...
SENSYS
2003
ACM
15 years 12 months ago
SIA: secure information aggregation in sensor networks
Sensor networks promise viable solutions to many monitoring problems. However, the practical deployment of sensor networks faces many challenges imposed by real-world demands. Sen...
Bartosz Przydatek, Dawn Xiaodong Song, Adrian Perr...
ACSAC
2010
IEEE
15 years 3 months ago
Heap Taichi: exploiting memory allocation granularity in heap-spraying attacks
Heap spraying is an attack technique commonly used in hijacking browsers to download and execute malicious code. In this attack, attackers first fill a large portion of the victim...
Yu Ding, Tao Wei, Tielei Wang, Zhenkai Liang, Wei ...