Sciweavers

17541 search results - page 3221 / 3509
» Complexity in scalable computing
Sort
View
ECCV
2010
Springer
15 years 10 months ago
The Quadratic-Chi Histogram Distance Family
We present a new histogram distance family, the Quadratic-Chi (QC). QC members are Quadratic-Form distances with a cross-bin χ2 -like normalization. The cross-bin χ2 -like normal...
SIGECOM
2010
ACM
183views ECommerce» more  SIGECOM 2010»
15 years 9 months ago
The unavailable candidate model: a decision-theoretic view of social choice
One of the fundamental problems in the theory of social choice is aggregating the rankings of a set of agents (or voters) into a consensus ranking. Rank aggregation has found appl...
Tyler Lu, Craig Boutilier
141
Voted
SPAA
2010
ACM
15 years 9 months ago
Securing every bit: authenticated broadcast in radio networks
This paper studies non-cryptographic authenticated broadcast in radio networks subject to malicious failures. We introduce two protocols that address this problem. The first, Nei...
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Zark...
164
Voted
GECCO
2010
Springer
191views Optimization» more  GECCO 2010»
15 years 9 months ago
Initialization parameter sweep in ATHENA: optimizing neural networks for detecting gene-gene interactions in the presence of sma
Recent advances in genotyping technology have led to the generation of an enormous quantity of genetic data. Traditional methods of statistical analysis have proved insufficient i...
Emily Rose Holzinger, Carrie C. Buchanan, Scott M....
MMB
2010
Springer
194views Communications» more  MMB 2010»
15 years 9 months ago
Searching for Tight Performance Bounds in Feed-Forward Networks
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
Andreas Kiefer, Nicos Gollan, Jens B. Schmitt
« Prev « First page 3221 / 3509 Last » Next »