Sciweavers

3894 search results - page 197 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
EMO
2003
Springer
109views Optimization» more  EMO 2003»
15 years 11 months ago
A Population and Interval Constraint Propagation Algorithm
We present PICPA, a new algorithm for tackling constrained continuous multi-objective problems. The algorithm combines constraint propagation techniques and evolutionary concepts. ...
Vincent Barichard, Jin-Kao Hao
CORR
2002
Springer
133views Education» more  CORR 2002»
15 years 6 months ago
Sequential and Parallel Algorithms for Mixed Packing and Covering
We describe sequential and parallel algorithms that approximately solve linear programs with no negative coefficients (a.k.a. mixed packing and covering problems). For explicitly ...
Neal E. Young
IPSN
2009
Springer
16 years 1 months ago
Approximating sensor network queries using in-network summaries
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
Alexandra Meliou, Carlos Guestrin, Joseph M. Helle...
CALC
2001
Springer
171views Cryptology» more  CALC 2001»
15 years 11 months ago
Approximate Integer Common Divisors
We show that recent results of Coppersmith, Boneh, Durfee and Howgrave-Graham actually apply in the more general setting of (partially) approximate common divisors. This leads us t...
Nick Howgrave-Graham
CISS
2008
IEEE
16 years 1 months ago
Reconstruction of compressively sensed images via neurally plausible local competitive algorithms
Abstract—We develop neurally plausible local competitive algorithms (LCAs) for reconstructing compressively sensed images. Reconstruction requires solving a sparse approximation ...
Robert L. Ortman, Christopher J. Rozell, Don H. Jo...