270 search results - page 36 / 54 » Partitioning into Sets of Bounded Cardinality |
CVGIP
2007
13 years 8 months ago
2007
This paper presents a technique for creating a smooth, closed surface from a set of 2D contours, which have been extracted from a 3D scan. The technique interprets the pixels that...
STACS
2007
Springer
14 years 2 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...
RTCSA
2007
IEEE
14 years 3 months ago
2007
IEEE
This paper presents a real-time scheduling algorithm with high schedulability and few preemptions for multiprocessor systems. The algorithm is based on an unorthodox method called...
COLT
2004
Springer
14 years 2 months ago
2004
Springer
Abstract— We prove that given a nearly log-concave distribution, in any partition of the space to two well separated sets, the measure of the points that do not belong to these s...
ICFEM
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. In formal testing, the assumption of input enabling is typically made. This assumption requires all inputs to be enabled anytime. In addition, the useful concept of quies...