7758 search results - page 191 / 1552 » On the Number of Distributive Lattices |
186
click to vote
WDAG
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...
189
click to vote
EUROCRYPT
2004
Springer
15 years 12 months ago
2004
Springer
We prove a tight lower bound for generic protocols for secure multicast key distribution where the messages sent by the group manager for rekeying the group are obtained by arbitra...
191
click to vote
IPSN
2004
Springer
15 years 11 months ago
2004
Springer
In this paper, we study the optimal way of distributing sensors in a random field to minimize the estimation distortion. We show that this problem is equivalent to certain proble...
168
click to vote
NPC
2004
Springer
15 years 11 months ago
2004
Springer
The complexity of services and applications provided by Web sites is ever increasing as integration of traditional Web publishing sites with new paradigms, i.e., e-commerce. Each d...
149
click to vote
HOTOS
2003
IEEE
15 years 11 months ago
2003
IEEE
The emergence of the global Internet has dramatically broadened and changed the computing landscape. In particular, much of the value in contemporary computing systems derives fro...