9842 search results - page 1345 / 1969 » The Complexity of the Matching-Cut Problem |
183
Voted
ICDCS
2009
IEEE
16 years 4 months ago
2009
IEEE
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...
163
click to vote
ICCAD
2008
IEEE
16 years 4 months ago
2008
IEEE
—Connecting system-level performance models with circuit information has been a long-standing problem in analog/mixed-signal front-ends, like radios and high-speed links. High-sp...
169
Voted
ICCAD
2006
IEEE
16 years 4 months ago
2006
IEEE
Stalls, due to mis-matches in communication rates, are a major performance obstacle in pipelined circuits. If the rate of data production is faster than the rate of consumption, t...
179
click to vote
CP
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. VLSI chips design is becoming increasingly complex and calling for more and more automation. Many chip design problems can be formulated naturally as constraint problems ...
186
click to vote
KDD
2009
ACM
16 years 2 months ago
2009
ACM
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...