Sciweavers

486 search results - page 66 / 98
» Improved upper bounds for 3-SAT
Sort
View
ICASSP
2011
IEEE
13 years 7 days ago
Proportionate-type normalized least mean square algorithm with gain allocation motivated by minimization of mean-square-weight d
In previous work, a water-filling algorithm was proposed which sought to minimize the mean square error (MSE) at any given time by optimally choosing the gains (i.e. step-sizes) ...
Kevin T. Wagner, Milos Doroslovacki
ICASSP
2011
IEEE
13 years 6 days ago
Weighted compressed sensing and rank minimization
—We present an alternative analysis of weighted 1 minimization for sparse signals with a nonuniform sparsity model, and extend our results to nuclear norm minimization for matric...
Samet Oymak, M. Amin Khajehnejad, Babak Hassibi
ECRTS
1998
IEEE
14 years 23 days ago
Using exact feasibility tests for allocating real-time tasks in multiprocessor systems
This paper introduces improvements in partitioning schemes for multiprocessor real-time systems which allow higher processor utilization and enhanced schedulability by using exact...
Sergio Saez, Joan Vila i Carbó, Alfons Cres...
ECCC
2006
70views more  ECCC 2006»
13 years 8 months ago
Finding a Heaviest Triangle is not Harder than Matrix Multiplication
We show that for any > 0, a maximum-weight triangle in an undirected graph with n vertices and real weights assigned to vertices can be found in time O(n + n2+), where is the ...
Artur Czumaj, Andrzej Lingas
CVPR
2009
IEEE
3784views Computer Vision» more  CVPR 2009»
15 years 3 months ago
What is the Spatial Extent of an Object?
This paper discusses the question: Can we improve the recognition of objects by using their spatial context? We start from Bag-of-Words models and use the Pascal 2007 dataset. We u...
Arnold W. M. Smeulders, Jasper R. R. Uijlings, Rem...