11345 search results - page 1620 / 2269 » Foundations of Computer Science |
184
click to vote
STACS
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneous...
209
click to vote
STACS
2007
Springer
16 years 1 months ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
183
click to vote
STACS
2007
Springer
16 years 1 months ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
187
click to vote
ACSC
2006
IEEE
16 years 1 months ago
2006
IEEE
Publish/subscribe systems utilize filter algorithms to determine all subscriptions matching incoming event messages. To distribute such services, subscriptions are forwarded to s...
191
click to vote
ACMSE
2006
ACM
16 years 1 months ago
2006
ACM
Without physical boundaries, a wireless network faces many more security threats than a wired network does. Therefore, in the IEEE 802.16 standard a security sublayer is specified...