Sciweavers

1477 search results - page 116 / 296
» Complexity of (iterated) dominance
Sort
View
COMPGEOM
2009
ACM
16 years 28 days ago
Approximate center points with proofs
We present the Iterated-Tverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S ∈ Rd with running time sub-exponential in d. T...
Gary L. Miller, Donald Sheehy
CISS
2008
IEEE
16 years 26 days ago
Near optimal lossy source coding and compression-based denoising via Markov chain Monte Carlo
— We propose an implementable new universal lossy source coding algorithm. The new algorithm utilizes two wellknown tools from statistical physics and computer science: Gibbs sam...
Shirin Jalali, Tsachy Weissman
VTC
2007
IEEE
16 years 20 days ago
Power Optimization of IDMA Systems with Different Target BER Constraints
— Interleave Division Multiple Access (IDMA) is a promising air interface for future wireless networks. Optimization of access schemes regarding cross user aspects is also a topi...
Petra Weitkemper, Karl-Dirk Kammeyer
WISE
2002
Springer
15 years 11 months ago
An MDP-based Peer-to-Peer Search Server Network
A distributed search system consists of a large number of autonomous search servers logically connected in a peerto-peer network. Each search server maintains a local index of a c...
Yipeng Shen, Dik Lun Lee
ESTIMEDIA
2006
Springer
15 years 10 months ago
Loop Nest Splitting for WCET-Optimization and Predictability Improvement
This paper presents the influence of the loop nest splitting source code optimization on the worst-case execution time (WCET). Loop nest splitting minimizes the number of executed...
Heiko Falk, Martin Schwarzer