61 search results - page 8 / 13 » Approximation Algorithms for Survivable Optical Networks |
IPPS
2009
IEEE
14 years 2 months ago
2009
IEEE
—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...
IPPS
2005
IEEE
14 years 1 months ago
2005
IEEE
Title of thesis: BOOTSTRAPPING FREE-SPACE OPTICAL NETWORKS Fang Liu, Master of Science, 2004 Thesis directed by: Professor Uzi Vishkin Department of Electrical and Computer Engine...
KDD
2004
ACM
14 years 8 months ago
2004
ACM
In order to effectively use machine learning algorithms, e.g., neural networks, for the analysis of survival data, the correct treatment of censored data is crucial. The concordan...
ALGORITHMICA
1999
13 years 7 months ago
1999
In this paper, we consider the following question: what is the maximum number of entries that can be added to a partially lled latin square? The decision version of this question ...
IJCV
2012
11 years 10 months ago
2012
Abstract We tackle the problem of detecting occluded regions in a video stream. Under assumptions of Lambertian reflection and static illumination, the task can be posed as a vari...