2304 search results - page 288 / 461 » On the Vulnerability of Large Graphs |
179
click to vote
IJCAI
2001
15 years 8 months ago
2001
We propose a perspective on knowledge compilation which calls for analyzing different compilation approaches according to two key dimensions: the succinctness of the target compil...
176
click to vote
IAAI
2003
15 years 8 months ago
2003
Pattern matching for intelligence organizations is a challenging problem. The data sets are large and noisy, and there is a flexible and constantly changing notion of what consti...
189
click to vote
SODA
2001
ACM
15 years 8 months ago
2001
ACM
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
159
click to vote
ICASSP
2010
IEEE
15 years 6 months ago
2010
IEEE
In this paper a large amount of absolute mean opinion scores obtained within a single listening test are presented. Naïve listeners’ preference on different speech signal prope...
180
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We introduce ‘atomic flows’: they are graphs obtained from derivations by tracing atom occurrences and forgetting the logical structure. We study simple manipulations of atomi...