Sciweavers

CORR
2008
Springer
87views Education» more  CORR 2008»
13 years 8 months ago
Green Codes: Energy-Efficient Short-Range Communication
Abstract-- A green code attempts to minimize the total energy per-bit required to communicate across a noisy channel. The classical information-theoretic approach neglects the ener...
Pulkit Grover, Anant Sahai
CORR
2008
Springer
109views Education» more  CORR 2008»
13 years 8 months ago
Malicious Bayesian Congestion Games
In this paper, we introduce malicious Bayesian congestion games as an extension to congestion games where players might act in a malicious way. In such a game each player has two t...
Martin Gairing
CORR
2008
Springer
130views Education» more  CORR 2008»
13 years 8 months ago
A Kernel Method for the Two-Sample Problem
We propose two statistical tests to determine if two samples are from different distributions. Our test statistic is in both cases the distance between the means of the two sample...
Arthur Gretton, Karsten M. Borgwardt, Malte J. Ras...
CORR
2008
Springer
93views Education» more  CORR 2008»
13 years 8 months ago
An optimization problem on the sphere
We prove existence and uniqueness of the minimizer for the average geodesic distance to the points of a geodesically convex set on the sphere. This implies a corresponding existen...
Andreas Maurer
CORR
2008
Springer
51views Education» more  CORR 2008»
13 years 8 months ago
Computing the fixing group of a rational function
Jaime Gutierrez, Rosario Rubio, David Sevilla
CORR
2010
Springer
148views Education» more  CORR 2010»
13 years 8 months ago
Data Sharing Options for Scientific Workflows on Amazon EC2
Efficient data management is a key component in achieving good performance for scientific workflows in distributed environments. Workflow applications typically communicate data be...
Gideon Juve, Ewa Deelman, Karan Vahi, Gaurang Meht...
CORR
2008
Springer
121views Education» more  CORR 2008»
13 years 8 months ago
Graph Algorithms for Improving Type-Logical Proof Search
Proof nets are a graph theoretical representation of proofs in various fragments of type-logical grammar. In spite of this basis in graph theory, there has been relatively little ...
Richard Moot
CORR
2010
Springer
59views Education» more  CORR 2010»
13 years 8 months ago
Spectral Perturbation and Reconstructability of Complex Networks
D. Liu, Huijuan Wang, Piet Van Mieghem
CORR
2008
Springer
76views Education» more  CORR 2008»
13 years 8 months ago
Constraint Complexity of Realizations of Linear Codes on Arbitrary Graphs
ABSTRACT. A graphical realization of a linear code C consists of an assignment of the coordinates of C to the vertices of a graph, along with a specification of linear state spaces...
Navin Kashyap
CORR
2008
Springer
84views Education» more  CORR 2008»
13 years 8 months ago
Path Diversity over Packet Switched Networks: Performance Analysis and Rate Allocation
Shervan Fashandi, Shahab Oveis Gharan, Amir K. Kha...