Sciweavers

631 search results - page 85 / 127
» Additive Approximation for Edge-Deletion Problems
Sort
View
COMPGEOM
2009
ACM
14 years 3 months ago
Coresets for polytope distance
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
Bernd Gärtner, Martin Jaggi
CORR
2011
Springer
202views Education» more  CORR 2011»
13 years 4 months ago
Multi-skill Collaborative Teams based on Densest Subgraphs
We consider the problem of identifying a team of skilled individuals for collaboration, in the presence of a social network. Each node in the input social network may be an expert...
Amita Gajewar, Atish Das Sarma
SIGECOM
2003
ACM
122views ECommerce» more  SIGECOM 2003»
14 years 2 months ago
On polynomial-time preference elicitation with value queries
Preference elicitation — the process of asking queries to determine parties’ preferences — is a key part of many problems in electronic commerce. For example, a shopping age...
Martin Zinkevich, Avrim Blum, Tuomas Sandholm
JCC
2006
110views more  JCC 2006»
13 years 9 months ago
Using internal and collective variables in Monte Carlo simulations of nucleic acid structures: Chain breakage/closure algorithm
: This article describes a method for solving the geometric closure problem for simplified models of nucleic acid structures by using the constant bond lengths approximation. The r...
Heinz Sklenar, Daniel Wüstner, Remo Rohs
MP
2007
145views more  MP 2007»
13 years 8 months ago
Machine scheduling with resource dependent processing times
We consider machine scheduling on unrelated parallel machines with the objective to minimize the schedule makespan. We assume that, in addition to its machine dependence, the proce...
Alexander Grigoriev, Maxim Sviridenko, Marc Uetz