Sciweavers

466 search results - page 91 / 94
» Preprocessing Search Spaces for Branch and Bound Search
Sort
View
CCS
2006
ACM
14 years 11 months ago
Dynamic rule-ordering optimization for high-speed firewall filtering
Packet filtering plays a critical role in many of the current high speed network technologies such as firewalls and IPSec devices. The optimization of firewall policies is critica...
Hazem Hamed, Ehab Al-Shaer
KDD
2009
ACM
163views Data Mining» more  KDD 2009»
15 years 10 months ago
Large-scale graph mining using backbone refinement classes
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
Andreas Maunz, Christoph Helma, Stefan Kramer
DAGSTUHL
2006
14 years 10 months ago
Efficient Software Model Checking of Data Structure Properties
This paper presents novel language and analysis techniques that significantly speed up software model checking of data structure properties. Consider checking a red-black tree imp...
Chandrasekhar Boyapati, Paul T. Darga
SIAMCOMP
1998
138views more  SIAMCOMP 1998»
14 years 9 months ago
Dynamic Trees and Dynamic Point Location
This paper describes new methods for maintaining a point-location data structure for a dynamically changing monotone subdivision S. The main approach is based on the maintenance of...
Michael T. Goodrich, Roberto Tamassia
ICDE
2006
IEEE
144views Database» more  ICDE 2006»
15 years 10 months ago
Approximately Processing Multi-granularity Aggregate Queries over Data Streams
Aggregate monitoring over data streams is attracting more and more attention in research community due to its broad potential applications. Existing methods suffer two problems, 1...
Shouke Qin, Weining Qian, Aoying Zhou