2489 search results - page 183 / 498 » On the Subgroup Distance Problem |
137
click to vote
ALGOSENSORS
2009
Springer
15 years 11 months ago
2009
Springer
We study scenarios where mobile hubs are charged with building a communication bridge between two given points s and t. We introduce a new bi-criteria optimization problem where th...
157
click to vote
ACSC
2005
IEEE
15 years 10 months ago
2005
IEEE
A k-separated matching in a graph is a set of edges at distance at least k from one another (hence, for instance, a 1-separated matching is just a matching in the classical sense)...
ICPR
2000
IEEE
15 years 8 months ago
2000
IEEE
Vectorization, i.e. raster–to–vector conversion, is a central part of graphics recognition problems. In this paper, we discuss the pros and the cons of basing one’s vectoriz...
100
click to vote
AIPS
2008
15 years 6 months ago
2008
We present a complex scheduling problem where we want to plan meetings between customers and exhibitors at a trade event. One cause of the complexity of the problem is the general...
118
click to vote
ENTCS
2008
15 years 4 months ago
2008
We establish a monotonicity principle for convex functions that enables high-level reasoning about capacity in information theory. Despite its simplicity, this single idea is rema...