Sciweavers

419 search results - page 80 / 84
» First Order Paths in Ordered Trees
Sort
View
ICALP
2009
Springer
14 years 10 months ago
Counting Subgraphs via Homomorphisms
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
Omid Amini, Fedor V. Fomin, Saket Saurabh
ICCD
2006
IEEE
86views Hardware» more  ICCD 2006»
14 years 7 months ago
Interconnect Matching Design Rule Inferring and Optimization through Correlation Extraction
— New back-end design for manufacturability rules have brought guarantee rules for interconnect matching. These rules indicate a certain capacitance matching guarantee given spac...
Rasit Onur Topaloglu, Andrew B. Kahng
KDD
2009
ACM
200views Data Mining» more  KDD 2009»
14 years 4 months ago
Visual analysis of documents with semantic graphs
In this paper, we present a technique for visual analysis of documents based on the semantic representation of text in the form of a directed graph, referred to as semantic graph....
Delia Rusu, Blaz Fortuna, Dunja Mladenic, Marko Gr...
ICDM
2007
IEEE
99views Data Mining» more  ICDM 2007»
14 years 4 months ago
Optimizing Frequency Queries for Data Mining Applications
Data mining algorithms use various Trie and bitmap-based representations to optimize the support (i.e., frequency) counting performance. In this paper, we compare the memory requi...
Hassan H. Malik, John R. Kender
CCS
2007
ACM
14 years 4 months ago
Defining categories to select representative attack test-cases
To ameliorate the quality of protection provided by intrusion detection systems (IDS) we strongly need more effective evaluation and testing procedures. Evaluating an IDS against ...
Mohammed S. Gadelrab, Anas Abou El Kalam, Yves Des...