Sciweavers

1289 search results - page 183 / 258
» Complexity of Counting the Optimal Solutions
Sort
View
CDC
2010
IEEE
128views Control Systems» more  CDC 2010»
14 years 4 months ago
Greedy sensor selection: Leveraging submodularity
ACT We consider the problem of sensor selection in resource constrained sensor networks. The fusion center selects a subset of k sensors from an available pool of m sensors accordi...
Manohar Shamaiah, Siddhartha Banerjee, Haris Vikal...
PAMI
2012
13 years 8 days ago
Angular Embedding: A Robust Quadratic Criterion
Abstract—Given the size and confidence of pairwise local orderings, angular embedding (AE) finds a global ordering with a nearglobal optimal eigensolution. As a quadratic crite...
Stella Yu
STOC
2009
ACM
159views Algorithms» more  STOC 2009»
15 years 10 months ago
Message passing algorithms and improved LP decoding
Linear programming decoding for low-density parity check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its p...
Sanjeev Arora, Constantinos Daskalakis, David Steu...
CODES
2005
IEEE
15 years 3 months ago
Comparing two testbench methods for hierarchical functional verification of a bluetooth baseband adaptor
The continuous improvement on the design methodologies and processes has made possible the creation of huge and very complex digital systems. Design verification is one of the mai...
Edgar L. Romero, Marius Strum, Wang Jiang Chau
GECCO
2007
Springer
166views Optimization» more  GECCO 2007»
15 years 1 months ago
Crossover: the divine afflatus in search
The traditional GA theory is pillared on the Building Block Hypothesis (BBH) which states that Genetic Algorithms (GAs) work by discovering, emphasizing and recombining low order ...
David Iclanzan