Sciweavers

1814 search results - page 17 / 363
» Improved Results on Geometric Hitting Set Problems
Sort
View
GEOINFORMATICA
1998
79views more  GEOINFORMATICA 1998»
13 years 7 months ago
Symbolic Intersect Detection: A Method for Improving Spatial Intersect Joins
Due to the increasing popularity of spatial databases, researchers have focused their efforts on improving the query processing performance of the most expensive spatial database ...
Yun-Wu Huang, Matthew C. Jones, Elke A. Rundenstei...
WWW
2002
ACM
13 years 7 months ago
Improvement of HITS-based algorithms on web documents
In this paper, we present two ways to improve the precision of HITS-based algorithms on Web documents. First, by analyzing the limitations of current HITS-based algorithms, we pro...
Longzhuang Li, Yi Shang, Wei Zhang
FSTTCS
2004
Springer
14 years 1 months ago
Testing Geometric Convexity
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...
Luis Rademacher, Santosh Vempala
JGO
2008
111views more  JGO 2008»
13 years 7 months ago
A geometric framework for nonconvex optimization duality using augmented lagrangian functions
We provide a unifying geometric framework for the analysis of general classes of duality schemes and penalty methods for nonconvex constrained optimization problems. We present a ...
Angelia Nedic, Asuman E. Ozdaglar
TAMC
2009
Springer
14 years 2 months ago
Linear Programming Based Approximation Algorithms for Feedback Set Problems in Bipartite Tournaments
We consider the feedback vertex set and feedback arc set problems in bipartite tournaments. We improve on recent results by giving a 2-approximation algorithm for the feedback vert...
Anke van Zuylen