Sciweavers

3422 search results - page 341 / 685
» Random Subset Optimization
Sort
View
189
Voted
ARCS
2012
Springer
14 years 10 days ago
Fast Scenario-Based Design Space Exploration using Feature Selection
: This paper presents a novel approach to efficiently perform early system level design space exploration (DSE) of MultiProcessor System-on-Chip (MPSoC) based embedded systems. By...
Peter van Stralen, Andy D. Pimentel
SODA
2012
ACM
235views Algorithms» more  SODA 2012»
13 years 7 months ago
Fast zeta transforms for lattices with few irreducibles
We investigate fast algorithms for changing between the standard basis and an orthogonal basis of idempotents for M¨obius algebras of finite lattices. We show that every lattice...
Andreas Björklund, Mikko Koivisto, Thore Husf...
CORR
2010
Springer
121views Education» more  CORR 2010»
15 years 3 months ago
Mechanism Design via Correlation Gap
For revenue and welfare maximization in singledimensional Bayesian settings, Chawla et al. (STOC10) recently showed that sequential posted-price mechanisms (SPMs), though simple i...
Qiqi Yan
TON
2010
163views more  TON 2010»
15 years 3 months ago
Toward practical opportunistic routing with intra-session network coding for mesh networks
—We consider opportunistic routing in wireless mesh networks. We exploit the inherent diversity of the broadcast nature of wireless by making use of multi-path routing. We presen...
Bozidar Radunovic, Christos Gkantsidis, Peter B. K...
CVPR
2008
IEEE
16 years 6 months ago
Graph-shifts: Natural image labeling by dynamic hierarchical computing
In this paper, we present a new approach for image labeling based on the recently introduced graph-shifts algorithm. Graph-shifts is an energy minimization algorithm that does lab...
Jason J. Corso, Alan L. Yuille, Zhuowen Tu