Sciweavers

299 search results - page 50 / 60
» A Convex Relaxation Approach for Computing Minimal Partition...
Sort
View
EOR
2006
83views more  EOR 2006»
13 years 7 months ago
Lower bounds and heuristic algorithms for the k
We consider the problem of partitioning a set of positive integers values into a given number of subsets, each having an associated cardinality limit, so that the maximum sum of v...
Mauro Dell'Amico, Manuel Iori, Silvano Martello, M...
CVPR
2010
IEEE
14 years 4 months ago
Surface Extraction from Binary Volumes with Higher-Order Smoothness
A number of 3D shape reconstruction algorithms, in particular 3D image segmentation methods, produce their results in the form of binary volumes, where a binary value indicates whe...
Victor Lempitsky
CODES
2002
IEEE
14 years 21 days ago
Communication speed selection for embedded systems with networked voltage-scalable processors
High-speed serial network interfaces are gaining wide use in connecting multiple processors and peripherals in modern embedded systems, thanks to their size advantage and power ef...
Jinfeng Liu, Pai H. Chou, Nader Bagherzadeh
MFCS
2004
Springer
14 years 1 months ago
Optimal Preemptive Scheduling for General Target Functions
We study the problem of optimal preemptive scheduling with respect to a general target function. Given n jobs with associated weights and m ≤ n uniformly related machines, one a...
Leah Epstein, Tamir Tassa
CORR
2010
Springer
189views Education» more  CORR 2010»
13 years 6 months ago
Robust PCA via Outlier Pursuit
Singular Value Decomposition (and Principal Component Analysis) is one of the most widely used techniques for dimensionality reduction: successful and efficiently computable, it ...
Huan Xu, Constantine Caramanis, Sujay Sanghavi