Sciweavers

1389 search results - page 216 / 278
» Improved Approximation Algorithms for Label Cover Problems
Sort
View
HEURISTICS
2008
120views more  HEURISTICS 2008»
14 years 10 months ago
A local linear embedding module for evolutionary computation optimization
A Local Linear Embedding (LLE) module enhances the performance of two Evolutionary Computation (EC) algorithms employed as search tools in global optimization problems. The LLE em...
Fabio Boschetti
IPSN
2009
Springer
15 years 4 months ago
Simultaneous placement and scheduling of sensors
We consider the problem of monitoring spatial phenomena, such as road speeds on a highway, using wireless sensors with limited battery life. A central question is to decide where ...
Andreas Krause, Ram Rajagopal, Anupam Gupta, Carlo...
ICDE
2007
IEEE
113views Database» more  ICDE 2007»
15 years 11 months ago
Reducing Order Enforcement Cost in Complex Query Plans
Algorithms that exploit sort orders are widely used to implement joins, grouping, duplicate elimination and other set operations. Query optimizers traditionally deal with sort ord...
Ravindra Guravannavar, S. Sudarshan
STOC
2004
ACM
88views Algorithms» more  STOC 2004»
15 years 10 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
IDA
2009
Springer
15 years 4 months ago
Bayesian Non-negative Matrix Factorization
Abstract. We present a Bayesian treatment of non-negative matrix factorization (NMF), based on a normal likelihood and exponential priors, and derive an efficient Gibbs sampler to ...
Mikkel N. Schmidt, Ole Winther, Lars Kai Hansen