Sciweavers

7006 search results - page 495 / 1402
» Approximation Algorithms
Sort
View
DCG
2010
137views more  DCG 2010»
15 years 6 months ago
Improved Results on Geometric Hitting Set Problems
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
Nabil H. Mustafa, Saurabh Ray
160
Voted
SIGECOM
2008
ACM
94views ECommerce» more  SIGECOM 2008»
15 years 6 months ago
Optimizing query rewrites for keyword-based advertising
We consider the problem of query rewrites in the context of keyword advertisement. Given a three-layer graph consisting of queries, query rewrites, and the corresponding ads that ...
Azarakhsh Malekian, Chi-Chao Chang, Ravi Kumar, Gr...
IJCSA
2007
110views more  IJCSA 2007»
15 years 6 months ago
Multiprocessor Scheduling Using Hybrid Particle Swarm Optimization with Dynamically Varying Inertia
The problem of task assignment in heterogeneous computing systems has been studied for many years with many variations. We have developed a new hybrid approximation algorithm. The...
S. N. Sivanandam, P. Visalakshi, A. Bhuvaneswari
VISUALIZATION
2002
IEEE
15 years 11 months ago
Efficient Simplification of Point-Sampled Surfaces
In this paper we introduce, analyze and quantitatively compare a number of surface simplification methods for point-sampled geometry. We have implemented incremental and hierarchi...
Mark Pauly, Markus H. Gross, Leif Kobbelt
ESA
2006
Springer
109views Algorithms» more  ESA 2006»
15 years 10 months ago
Multiline Addressing by Network Flow
We consider an optimization problem arising in the design of controllers for OLED displays. Our objective is to minimize amplitude of the electrical current through the diodes whic...
Friedrich Eisenbrand, Andreas Karrenbauer, Martin ...