Sciweavers

1420 search results - page 102 / 284
» Representation of Graphs by OBDDs
Sort
View
CP
2009
Springer
16 years 7 months ago
Constraint-Based Optimal Testing Using DNNF Graphs
The goal of testing is to distinguish between a number of hypotheses about a systemfor example, dierent diagnoses of faults by applying input patterns and verifying or falsifying t...
Anika Schumann, Martin Sachenbacher, Jinbo Huang
MM
2006
ACM
148views Multimedia» more  MM 2006»
16 years 10 days ago
Audio similarity measure by graph modeling and matching
This paper proposes a new approach for the similarity measure and ranking of audio clips by graph modeling and matching. Instead of using frame-based or salient-based features to ...
Yuxin Peng, Chong-Wah Ngo, Cuihua Fang, Xiaoou Che...
ACSAC
2003
IEEE
15 years 11 months ago
Efficient Minimum-Cost Network Hardening Via Exploit Dependency Graphs
In-depth analysis of network security vulnerability must consider attacker exploits not just in isolation, but also in combination. The general approach to this problem is to comp...
Steven Noel, Sushil Jajodia, Brian O'Berry, Michae...
EVOW
2005
Springer
15 years 11 months ago
Heuristic Colour Assignment Strategies for Merge Models in Graph Colouring
In this paper, we combine a powerful representation for graph colouring problems with different heuristic strategies for colour assignment. Our novel strategies employ heuristics ...
István Juhos, Attila Tóth, Jano I. v...
ECAI
2008
Springer
15 years 8 months ago
BIDFLOW: a New Graph-Based Bidding Language for Combinatorial Auctions
In this paper we introduce a new graph based bidding language for combinatorial auctions. In our language, each bidder submits to the arbitrator a generalized flow network (netbid...
Madalina Croitoru, Cornelius Croitoru, Paul H. Lew...