Sciweavers

4118 search results - page 314 / 824
» Efficient Algorithms for Airline Problem
Sort
View
STOC
2002
ACM
103views Algorithms» more  STOC 2002»
16 years 5 months ago
Approximate clustering via core-sets
In this paper, we show that for several clustering problems one can extract a small set of points, so that using those core-sets enable us to perform approximate clustering effici...
Mihai Badoiu, Sariel Har-Peled, Piotr Indyk
IPPS
2007
IEEE
15 years 11 months ago
An Artificial Immune System for Heterogeneous Multiprocessor Scheduling with Task Duplication
In this study, we investigate the task scheduling problem in heterogeneous computing environments and propose a novel scheduling algorithm, called the Artificial Immune System wit...
Young Choon Lee, Albert Y. Zomaya
IANDC
2006
86views more  IANDC 2006»
15 years 4 months ago
Table design in dynamic programming
Dynamic Programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The first step in the design of a dynamic program...
Peter Steffen, Robert Giegerich
CGF
2008
227views more  CGF 2008»
15 years 5 months ago
Dynamic Sampling and Rendering of Algebraic Point Set Surfaces
Algebraic Point Set Surfaces (APSS) define a smooth surface from a set of points using local moving least-squares (MLS) fitting of algebraic spheres. In this paper we first revisi...
Gaël Guennebaud, Marcel Germann, Markus H. Gr...
CVPR
2009
IEEE
17 years 4 hour ago
Higher-Order Clique Reduction in Binary Graph Cut
We introduce a new technique that can reduce any higher-order Markov random field with binary labels into a first-order one that has the same minima as the original. Moreover, w...
Hiroshi Ishikawa 0002