Sciweavers

1158 search results - page 75 / 232
» Approximation Algorithms for the Fixed-Topology Phylogenetic...
Sort
View
IJSNET
2008
125views more  IJSNET 2008»
15 years 4 months ago
Minimum-cost sensor arrangement for achieving wanted coverage lifetime
: Suppose we need to watch a set of targets continuously for a required period of time, and suppose we choose any number of sensors from a fixed set of sensor types and place them ...
Jie Wang, Ning Zhong
COCOON
2010
Springer
15 years 9 months ago
Clustering with or without the Approximation
We study algorithms for clustering data that were recently proposed by Balcan, Blum and Gupta in SODA’09 [4] and that have already given rise to two follow-up papers. The input f...
Frans Schalekamp, Michael Yu, Anke van Zuylen
ICASSP
2010
IEEE
15 years 4 months ago
A convex relaxation for approximate maximum-likelihood 2D source localization from range measurements
This paper addresses the problem of locating a single source from noisy range measurements in wireless sensor networks. An approximate solution to the maximum likelihood location ...
Pinar Oguz-Ekim, João Pedro Gomes, Jo&atild...
EC
2011
240views ECommerce» more  EC 2011»
14 years 11 months ago
HypE: An Algorithm for Fast Hypervolume-Based Many-Objective Optimization
Abstract—In the field of evolutionary multi-criterion optimization, the hypervolume indicator is the only single set quality measure that is known to be strictly monotonic with ...
Johannes Bader, Eckart Zitzler
JCSS
2008
138views more  JCSS 2008»
15 years 4 months ago
Reducing mechanism design to algorithm design via machine learning
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a broad class of re...
Maria-Florina Balcan, Avrim Blum, Jason D. Hartlin...