309 search results - page 15 / 62 » On a Balanced Property of Derangements |
STOC
2010
ACM
14 years 9 months ago
2010
ACM
Let h > w > 0 be two fixed integers. Let H be a random hypergraph whose hyperedges are uniformly of size h. To w-orient a hyperedge, we assign exactly w of its vertices posi...
ICRA
1994
IEEE
15 years 1 months ago
1994
IEEE
While most previous work in planning manipulation tasks relies on the assumption of quasi-static conditions, there can be situations where the quasi-static assumption may not hold...
100
click to vote
ISPAN
2008
IEEE
15 years 4 months ago
2008
IEEE
Intuitively, a signed graph is a graph in which every edge is labeled with a + or − sign. For each edge, its sign represents the mode of the relationship between the vertices it...
101
click to vote
QUESTA
2010
14 years 4 months ago
2010
Consider a multiclass stochastic network with state dependent service rates and arrival rates describing bandwidth-sharing mechanisms as well as admission control and/or load bala...
94
Voted
CVPR
2011
IEEE
14 years 1 months ago
2011
IEEE
We propose a new objective function for superpixel segmentation. This objective function consists of two components: entropy rate of a random walk on a graph and a balancing term....