Sciweavers

291 search results - page 29 / 59
» On Generalizing Pawlak Approximation Operators
Sort
View
IPPS
2009
IEEE
14 years 3 months ago
Minimizing total busy time in parallel scheduling with application to optical networks
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...
Michele Flammini, Gianpiero Monaco, Luca Moscardel...
INFOCOM
2007
IEEE
14 years 2 months ago
Algorithmic Aspects of Access Networks Design in B3G/4G Cellular Networks
— The forthcoming 4G cellular systems will provide broadband wireless access to a variety of advanced data and voice services. In order to do that, these networks will have a sig...
David Amzallag, Joseph Naor, Danny Raz
PG
2007
IEEE
14 years 2 months ago
Point-Based Minkowski Sum Boundary
Minkowski sum is a fundamental operation in many geometric applications, including robotics, penetration depth estimation, solid modeling, and virtual prototyping. However, due to...
Jyh-Ming Lien
ICIP
2003
IEEE
14 years 1 months ago
Shape metrics, warping and statistics
We propose to use approximations of shape metrics, such as the Hausdorff distance, to define similarity measures between shapes. Our approximations being continuous and different...
Guillaume Charpiat, Olivier D. Faugeras, Renaud Ke...
COLT
1999
Springer
14 years 27 days ago
Covering Numbers for Support Vector Machines
—Support vector (SV) machines are linear classifiers that use the maximum margin hyperplane in a feature space defined by a kernel function. Until recently, the only bounds on th...
Ying Guo, Peter L. Bartlett, John Shawe-Taylor, Ro...