Sciweavers

118 search results - page 11 / 24
» Approximation Schemes for Euclidean k-Medians and Related Pr...
Sort
View
ICPR
2008
IEEE
14 years 8 months ago
Solving quadratically constrained geometrical problems using lagrangian duality
In this paper we consider the problem of solving different pose and registration problems under rotational constraints. Traditionally, methods such as the iterative closest point ...
Carl Olsson, Anders Eriksson
SRDS
1998
IEEE
13 years 11 months ago
An Efficient Scheme to Reduce Handoff Dropping in LEO Satellite Systems
The problem of handoffs in cellular networks is compounded in a low earth orbit (LEO) satellite-based cellular network due to the relative motion of the satellites with respect to ...
Suresh Kalyanasundaram, Edwin K. P. Chong, Ness B....
PSB
2004
13 years 8 months ago
Multiplexing Schemes for Generic SNP Genotyping Assays
Association studies in populations relate genomic variation among individuals with medical condition. Key to these studies is the development of efficient and affordable genotypin...
Roded Sharan, Amir Ben-Dor, Zohar Yakhini
FOCS
2004
IEEE
13 years 11 months ago
An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...
Lap Chi Lau
APPROX
2008
Springer
142views Algorithms» more  APPROX 2008»
13 years 9 months ago
Approximating Maximum Subgraphs without Short Cycles
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
Guy Kortsarz, Michael Langberg, Zeev Nutov