Sciweavers

333 search results - page 9 / 67
» A Unifying Framework for the Analysis of a Class of Euclidea...
Sort
View
PAMI
2007
154views more  PAMI 2007»
13 years 7 months ago
Graph Embedding and Extensions: A General Framework for Dimensionality Reduction
—Over the past few decades, a large family of algorithms—supervised or unsupervised; stemming from statistics or geometry theory—has been designed to provide different soluti...
Shuicheng Yan, Dong Xu, Benyu Zhang, HongJiang Zha...
IPCO
1998
152views Optimization» more  IPCO 1998»
13 years 9 months ago
Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems
Abstract. A well studied and difficult class of scheduling problems concerns parallel machines and precedence constraints. In order to model more realistic situations, we consider ...
Alix Munier, Maurice Queyranne, Andreas S. Schulz
MP
1998
109views more  MP 1998»
13 years 7 months ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra
PLDI
2000
ACM
13 years 12 months ago
A framework for interprocedural optimization in the presence of dynamic class loading
Dynamic class loading during program execution in the JavaTM Programming Language is an impediment for generating code that is as e cient as code generated using static wholeprogr...
Vugranam C. Sreedhar, Michael G. Burke, Jong-Deok ...
PAMI
2008
121views more  PAMI 2008»
13 years 7 months ago
Theoretical Foundations of Spatially-Variant Mathematical Morphology Part II: Gray-Level Images
In this paper, we develop a spatially-variant (SV) mathematical morphology theory for gray-level signals and images in the euclidean space. The proposed theory preserves the geomet...
Nidhal Bouaynaya, Dan Schonfeld