324 search results - page 65 / 65 » Bounds for Functions of Dependent Risks |
102
click to vote
WINET
2010
14 years 10 months ago
2010
Abstract Algorithms for scheduling TDMA transmissions in multi-hop networks usually determine the smallest length conflict-free assignment of slots in which each link or node is a...
114
Voted
ICALP
2011
Springer
14 years 3 months ago
2011
Springer
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
100
Voted
PODS
2012
ACM
13 years 2 months ago
2012
ACM
We study the mergeability of data summaries. Informally speaking, mergeability requires that, given two summaries on two data sets, there is a way to merge the two summaries into ...
129
click to vote
INFOCOM
2012
IEEE
13 years 2 months ago
2012
IEEE
—A cardinal prerequisite for the system design of a sensor network, is to understand the geometric environment where sensor nodes are deployed. The global topology of a largescal...