Sciweavers

218 search results - page 21 / 44
» Convexity-based algorithms for design centering
Sort
View
COMPGEOM
2006
ACM
14 years 1 months ago
Minimum-cost coverage of point sets by disks
We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (tj) and radii (rj) that cover a given set of...
Helmut Alt, Esther M. Arkin, Hervé Brö...
ICPR
2008
IEEE
14 years 2 months ago
A supervised learning approach for imbalanced data sets
This paper presents a new learning approach for pattern classification applications involving imbalanced data sets. In this approach, a clustering technique is employed to resamp...
Giang Hoang Nguyen, Abdesselam Bouzerdoum, Son Lam...
ICRA
2008
IEEE
158views Robotics» more  ICRA 2008»
14 years 2 months ago
Boundary following by robot formations without GPS
— We design sensing algorithms and a control law for a group of mobile robots to follow a boundary curve without utilizing a global positioning system (GPS). The sensing algorith...
Fumin Zhang, Salman Haq
CLUSTER
2006
IEEE
14 years 1 months ago
Heterogeneous Parallel Computing in Remote Sensing Applications: Current Trends and Future Perspectives
Heterogeneous networks of computers have rapidly become a very promising commodity computing solution, expected to play a major role in the design of high performance computing sy...
Antonio J. Plaza
STOC
1997
ACM
257views Algorithms» more  STOC 1997»
13 years 12 months ago
Practical Loss-Resilient Codes
We present randomized constructions of linear-time encodable and decodable codes that can transmit over lossy channels at rates extremely close to capacity. The encoding and decod...
Michael Luby, Michael Mitzenmacher, Mohammad Amin ...