Sciweavers

1082 search results - page 140 / 217
» Approximation Algorithms for Spreading Points
Sort
View
SIAMJO
2000
108views more  SIAMJO 2000»
13 years 9 months ago
Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
Mathematical programs with nonlinear complementarity constraints are reformulated using better-posed but nonsmooth constraints. We introduce a class of functions, parameterized by...
Houyuan Jiang, Daniel Ralph
CGF
1998
116views more  CGF 1998»
13 years 8 months ago
A Light Hierarchy for Fast Rendering of Scenes with Many Lights
We introduce a new data structure in the form of a light hierarchy for efficiently ray-tracing scenes with many light sources. An octree is constructed with the point light sourc...
Eric Paquette, Pierre Poulin, George Drettakis
KDD
2010
ACM
188views Data Mining» more  KDD 2010»
13 years 11 months ago
Inferring networks of diffusion and influence
Information diffusion and virus propagation are fundamental processes talking place in networks. While it is often possible to directly observe when nodes become infected, observi...
Manuel Gomez-Rodriguez, Jure Leskovec, Andreas Kra...
ICML
2005
IEEE
14 years 10 months ago
Core Vector Regression for very large regression problems
In this paper, we extend the recently proposed Core Vector Machine algorithm to the regression setting by generalizing the underlying minimum enclosing ball problem. The resultant...
Ivor W. Tsang, James T. Kwok, Kimo T. Lai
STOC
2004
ACM
88views Algorithms» more  STOC 2004»
14 years 9 months ago
Expander flows, geometric embeddings and graph partitioning
We give a O( log n)-approximation algorithm for sparsest cut, edge expansion, balanced separator, and graph conductance problems. This improves the O(log n)-approximation of Leig...
Sanjeev Arora, Satish Rao, Umesh V. Vazirani