3008 search results - page 494 / 602 » Independence in connected graphs |
302
click to vote
POPL
2002
ACM
16 years 7 months ago
2002
ACM
Dataflow analyses can have mutually beneficial interactions. Previous efforts to exploit these interactions have either (1) iteratively performed each individual analysis until no...
271
click to vote
VLDB
2007
ACM
16 years 7 months ago
2007
ACM
In order to optimize their revenues and profits, an increasing number of businesses organize their business activities in terms of business processes. Typically, they automate imp...
168
click to vote
ICCAD
2005
IEEE
16 years 3 months ago
2005
IEEE
Technology mapping based on DAG-covering suffers from the problem of structural bias: the structure of the mapped netlist depends strongly on the subject graph. In this paper we ...
189
click to vote
CVPR
2010
IEEE
16 years 3 months ago
2010
IEEE
When classifying high-dimensional sequence data, traditional methods (e.g., HMMs, CRFs) may require large amounts of training data to avoid overfitting. In such cases dimensional...
161
click to vote
COMPLEX
2009
Springer
16 years 1 months ago
2009
Springer
To probe network characteristics, two predominant ways of network comparison are global property statistics and subgraph enumeration. However, they suffer from limited information...