796 search results - page 95 / 160 » Approximating the centroid is hard |
SPAA
2010
ACM
13 years 8 months ago
2010
ACM
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
MST
2006
13 years 7 months ago
2006
A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-comple...
CIVR
2009
Springer
14 years 2 months ago
2009
Springer
The Bag of Visual Words (BoV) paradigm has successfully been applied to image content analysis tasks such as image classification and object detection. The basic BoV approach ove...
ECRTS
2005
IEEE
14 years 1 months ago
2005
IEEE
We consider the use of the earliest-deadline-first (EDF) scheduling algorithm in soft real-time multiprocessor systems. In hard real-time systems, a significant disparity exists...
STOC
2007
ACM
14 years 8 months ago
2007
ACM
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...