Sciweavers

7930 search results - page 645 / 1586
» Greedy in Approximation Algorithms
Sort
View
CORR
2008
Springer
234views Education» more  CORR 2008»
15 years 7 months ago
Bayesian Compressive Sensing via Belief Propagation
Compressive sensing (CS) is an emerging field based on the revelation that a small collection of linear projections of a sparse signal contains enough information for stable, sub-N...
Dror Baron, Shriram Sarvotham, Richard G. Baraniuk
HEURISTICS
2008
92views more  HEURISTICS 2008»
15 years 7 months ago
Learning heuristics for basic block instruction scheduling
Instruction scheduling is an important step for improving the performance of object code produced by a compiler. A fundamental problem that arises in instruction scheduling is to ...
Abid M. Malik, Tyrel Russell, Michael Chase, Peter...
COMCOM
2006
110views more  COMCOM 2006»
15 years 7 months ago
Localized routing with guaranteed delivery and a realistic physical layer in wireless sensor networks
Routing is the problem of sending a packet from a source node to a destination node in the network. Existing solutions for sensor networks assume a unit disk graph model, where me...
Milos Stojmenovic, Amiya Nayak
217
Voted
CORR
2007
Springer
167views Education» more  CORR 2007»
15 years 7 months ago
Optimal Solutions for Sparse Principal Component Analysis
Given a sample covariance matrix, we examine the problem of maximizing the variance explained by a linear combination of the input variables while constraining the number of nonze...
Alexandre d'Aspremont, Francis R. Bach, Laurent El...
197
Voted
KAIS
2006
97views more  KAIS 2006»
15 years 7 months ago
Web image indexing by using associated texts
In order to index Web images, the whole associated texts are partitioned into a sequence of text blocks, then the local relevance of a term to the corresponding image is calculated...
Zhiguo Gong, Leong Hou U, Chan Wa Cheang