2152 search results - page 165 / 431 » A Comparative Study of 2QBF Algorithms |
138
click to vote
WWW
2011
ACM
14 years 11 months ago
2011
ACM
In this work, we study the notion of competing campaigns in a social network. By modeling the spread of influence in the presence of competing campaigns, we provide necessary too...
142
Voted
IVC
2006
15 years 4 months ago
2006
While the SoftAssign algorithm imposes a two-way constraint embedded into the deterministic annealing scheme and the EMICP algorithm imposes a one-way constraint, they represent t...
148
click to vote
PPOPP
2012
ACM
14 years 6 days ago
2012
ACM
Speedups demonstrated for finding the biconnected components of a graph: 9x to 33x on the Explicit Multi-Threading (XMT) many-core computing platform relative to the best serial ...
157
click to vote
VLDB
1998
ACM
15 years 8 months ago
1998
ACM
Semistructured data is not strictly typed like relational or object-oriented data and may be irregular or incomplete. It often arises in practice, e.g., when heterogeneous data so...
140
click to vote
DAC
1996
ACM
15 years 8 months ago
1996
ACM
In this paper, we study the problem of decomposing gates in fanin-unbounded or K-bounded networks such that the K-input LUT mapping solutions computed by a depthoptimal mapper hav...