Sciweavers

105 search results - page 4 / 21
» Almost Optimal Solutions to k-Clustering Problems
Sort
View
EOR
2008
78views more  EOR 2008»
13 years 8 months ago
Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times
We consider an extension of the optimal searcher path problem (OSP), where a searcher moving through a discretised environment may now need to spend a nonuniform amount of time tr...
Haye Lau, Shoudong Huang, Gamini Dissanayake
ESA
2001
Springer
132views Algorithms» more  ESA 2001»
14 years 1 months ago
Greedy Algorithms for Minimisation Problems in Random Regular Graphs
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...
Michele Zito
CPAIOR
2006
Springer
14 years 7 days ago
The Timetable Constrained Distance Minimization Problem
We define the timetable constrained distance minimization problem (TCDMP) which is a sports scheduling problem applicable for tournaments where the total travel distance must be mi...
Rasmus V. Rasmussen, Michael A. Trick
GLVLSI
2005
IEEE
85views VLSI» more  GLVLSI 2005»
14 years 2 months ago
VLSI CAD tool protection by birthmarking design solutions
Many techniques have been proposed in the past for the protection of VLSI design IPs (intellectual property). CAD tools and algorithms are intensively used in all phases of modern...
Lin Yuan, Gang Qu, Ankur Srivastava
ICCV
2003
IEEE
14 years 10 months ago
Nonmetric Lens Distortion Calibration: Closed-form Solutions, Robust Estimation and Model Selection
This paper addresses the problem of calibrating camera lens distortion, which can be signi?cant in medium to wide angle lenses. While almost all existing nonmetric distortion cali...
Moumen T. El-Melegy, Aly A. Farag