Sciweavers

1399 search results - page 149 / 280
» New Algorithms for k-Center and Extensions
Sort
View
AIPS
2004
13 years 10 months ago
Iterative Relaxations for Iterative Flattening in Cumulative Scheduling
Cumulative scheduling is a generalization of jobshop scheduling, where machines have discrete capacities and activities may require several capacity units. This paper considers it...
Laurent Michel, Pascal Van Hentenryck
WSCG
2004
120views more  WSCG 2004»
13 years 10 months ago
Voxelization of Solids Using Simplicial Coverings
Rasterization of polygons in 2D is a well known problem, existing several optimal solutions to solve it. The extension of this problem to 3D is more difficult and most existing so...
Antonio J. Rueda Ruiz, Rafael Jesús Segura,...
AAAI
1998
13 years 10 months ago
Using Arc Weights to Improve Iterative Repair
One of the surprising findings from the study of CNF satisfiability in the 1990's has been the success of iterative repair techniques, and in particular of weighted iterative...
John Thornton, Abdul Sattar
DKE
2008
106views more  DKE 2008»
13 years 9 months ago
Towards optimal k-anonymization
When releasing microdata for research purposes, one needs to preserve the privacy of respondents while maximizing data utility. An approach that has been studied extensively in re...
Tiancheng Li, Ninghui Li
PR
2008
87views more  PR 2008»
13 years 8 months ago
Two-dimensional Laplacianfaces method for face recognition
In this paper we propose a two-dimensional (2D) Laplacianfaces method for face recognition. The new algorithm is developed based on two techniques, i.e., locality preserved embedd...
Ben Niu, Qiang Yang, Simon Chi-Keung Shiu, Sankar ...