Sciweavers

4698 search results - page 241 / 940
» Making Functionality More General
Sort
View
APPROX
2010
Springer
135views Algorithms» more  APPROX 2010»
15 years 4 months ago
Monotonicity Testing and Shortest-Path Routing on the Cube
We study the problem of monotonicity testing over the hypercube. As previously observed in several works, a positive answer to a natural question about routing properties of the hy...
Jop Briët, Sourav Chakraborty, David Garc&iac...
SYNTHESE
2008
81views more  SYNTHESE 2008»
15 years 4 months ago
Decision framing in judgment aggregation
Judgment aggregation problems are language dependent in that they may be framed in different yet equivalent ways. We formalize this dependence via the notion of translation invari...
Fabrizio Cariani, Marc Pauly, Josh Snyder
SIAMMA
2011
87views more  SIAMMA 2011»
14 years 11 months ago
Barycenters in the Wasserstein Space
In this paper, we introduce a notion of barycenter in the Wasserstein space which generalizes McCann’s interpolation to the case of more than two measures. We provide existence,...
Martial Agueh, Guillaume Carlier
TCOM
2010
92views more  TCOM 2010»
14 years 10 months ago
UWB receiver designs based on a gaussian-laplacian noise-plus-MAI model
Two novel receiver structures which surpass the performance of the conventional matched filter receiver are proposed for ultra-wide bandwidth multiple access communications. The pr...
Norman C. Beaulieu, Somasundaram Niranjayan
APLAS
2009
ACM
15 years 10 months ago
Asymptotic Resource Usage Bounds
When describing the resource usage of a program, it is usual to talk in asymptotic terms, such as the well-known “big O” notation, whereby we focus on the behaviour of the prog...
Elvira Albert, Diego Alonso, Puri Arenas, Samir Ge...