358 search results - page 15 / 72 » On the Distributed Complexity of Computing Maximal Matchings |
110
click to vote
ICC
2009
IEEE
15 years 8 months ago
2009
IEEE
— The design and analysis of capacity-approaching input signalling for optical intensity channels are presented. Both peak and average optical power constraints are considered in...
126
click to vote
CORR
2012
Springer
13 years 9 months ago
2012
Springer
Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been consid...
74
Voted
ICS
2010
Tsinghua U.
15 years 6 months ago
2010
Tsinghua U.
: Maximizing revenue in the presence of perfectly informed players is a well known goal in mechanism design. Yet, all current mechanisms for this goal are vulnerable to equilibrium...
186
click to vote
PODS
2009
ACM
16 years 2 months ago
2009
ACM
A distributed XML document is an XML document that spans several machines or Web repositories. We assume that a distribution design of the document tree is given, providing an XML...
129
click to vote
IJET
2007
15 years 1 months ago
2007
Remarkable advances in instructional communication technology (ICT) have now made is possible to provide high levels of enrichment and the kinds of curricular differentiation that...