Sciweavers

723 search results - page 129 / 145
» On the hyperbolicity constant in graphs
Sort
View
ICTAI
2010
IEEE
13 years 5 months ago
A New Filtering Based on Decomposition of Constraint Sub-Networks
In this paper, we introduce a new partial consistency for constraint networks which is called Structural Consistency of level w and is denoted w-SC consistency. This consistency i...
Philippe Jégou, Cyril Terrioux
ICASSP
2009
IEEE
13 years 5 months ago
On the recovery of nonnegative sparse vectors from sparse measurements inspired by expanders
This paper studies compressed sensing for the recovery of non-negative sparse vectors from a smaller number of measurements than the ambient dimension of the unknown vector. We fo...
M. Amin Khajehnejad, Babak Hassibi
TOC
2010
147views Management» more  TOC 2010»
13 years 2 months ago
Quantum Expanders: Motivation and Construction
: We define quantum expanders in a natural way and give two constructions of quantum expanders, both based on classical expander constructions. The first construction is algebraic,...
Avraham Ben-Aroya, Oded Schwartz, Amnon Ta-Shma
STOC
2009
ACM
163views Algorithms» more  STOC 2009»
14 years 8 months ago
Non-monotone submodular maximization under matroid and knapsack constraints
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, M...
FPGA
2010
ACM
209views FPGA» more  FPGA 2010»
14 years 4 months ago
FPGA power reduction by guarded evaluation
Guarded evaluation is a power reduction technique that involves identifying sub-circuits (within a larger circuit) whose inputs can be held constant (guarded) at specific times d...
Chirag Ravishankar, Jason Helge Anderson