Sciweavers

545 search results - page 78 / 109
» Simultaneous approximation by greedy algorithms
Sort
View
ALGORITHMICA
2010
155views more  ALGORITHMICA 2010»
13 years 8 months ago
Bin Packing with Rejection Revisited
We consider the following generalization of bin packing. Each item is associated with a size bounded by 1, as well as a rejection cost, that an algorithm must pay if it chooses not...
Leah Epstein
DATE
2002
IEEE
74views Hardware» more  DATE 2002»
14 years 1 months ago
Maze Routing with Buffer Insertion under Transition Time Constraints
In this paper, we address the problem of simultaneous routing and buffer insertion. Recently in [12, 22], the authors considered simultaneous maze routing and buffer insertion und...
Li-Da Huang, Minghorng Lai, D. F. Wong, Youxin Gao
SDM
2008
SIAM
118views Data Mining» more  SDM 2008»
13 years 10 months ago
Massive-Scale Kernel Discriminant Analysis: Mining for Quasars
We describe a fast algorithm for kernel discriminant analysis, empirically demonstrating asymptotic speed-up over the previous best approach. We achieve this with a new pattern of...
Ryan Riegel, Alexander Gray, Gordon Richards
INFORMATICALT
2007
92views more  INFORMATICALT 2007»
13 years 8 months ago
An Optimization of System for Automatic Recognition of Ischemic Stroke Areas in Computed Tomography Images
Abstract. The paper considers application of stochastic optimization to system of automatic recognition of ischemic stroke area on computed tomography (CT) images. The algorithm of...
Darius Grigaitis, Vaida Bartkute, Leonidas Sakalau...
CVPR
2006
IEEE
14 years 2 months ago
A Generalized EM Approach for 3D Model Based Face Recognition under Occlusions
This paper describes an algorithm for pose and illumination invariant face recognition from a single image under occlusions. The method iteratively estimates the parameters of a 3...
Michael De Smet, Rik Fransens, Luc J. Van Gool