1232 search results - page 158 / 247 » Digraphs: theory, algorithms and applications |
DAC
2006
ACM
14 years 10 months ago
2006
ACM
Design space exploration during high level synthesis is often conducted through ad-hoc probing of the solution space using some scheduling algorithm. This is not only time consumi...
SODA
2010
ACM
14 years 6 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
NDSS
2008
IEEE
14 years 3 months ago
2008
IEEE
Automatic signature generation is necessary because there may often be little time between the discovery of a vulnerability, and exploits developed to target the vulnerability. Mu...
COLT
1997
Springer
14 years 1 months ago
1997
Springer
We relate two problems that have been explored in two distinct communities. The first is the problem of combining expert advice, studied extensively in the computational learning...
ICIP
2006
IEEE
14 years 10 months ago
2006
IEEE
For the first time, we present an AM-FM image model that, in addition to being remarkably consistent with human visual perception, also provides perfect reconstruction of the imag...