2983 search results - page 71 / 597 » The group marriage problem |
185
Voted
ICDE
2004
IEEE
16 years 2 months ago
2004
IEEE
We describe and evaluate a query minimization technique that applies to XQueries, which are nested, perform arbitrary joins, and freely mix bag and set semantics. These features c...
73
Voted
ICRA
2007
IEEE
15 years 7 months ago
2007
IEEE
— Coalescence is the problem of isolated mobile robots independently searching for peers with the goal of forming a single connected network. This is important because communicat...
GC
2006
Springer
15 years 21 days ago
2006
Springer
We give a bound on the reconstructibility of an action G X in terms of the reconstructibility of a the action N X, where N is a normal subgroup of G, and the reconstructibility o...
96
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
Abstract. We consider the issue of exploiting symmetries in the hierarchy of semidefinite programming relaxations recently introduced in polynomial optimization. We focus on probl...
100
Voted
SODA
2010
ACM
15 years 10 months ago
2010
ACM
The group Steiner problem is a classical network design problem where we are given a graph and a collection of groups of vertices, and want to build a min-cost subgraph that conne...