Sciweavers

38
Voted
CORR
2010
Springer
53views Education» more  CORR 2010»
14 years 8 months ago
Multi-Agent Deployment for Visibility Coverage in Polygonal Environments with Holes
Karl J. Obermeyer, Anurag Ganguli, Francesco Bullo
CORR
2010
Springer
103views Education» more  CORR 2010»
14 years 8 months ago
Structural Solutions to Dynamic Scheduling for Multimedia Transmission in Unknown Wireless Environments
In this paper, we propose a systematic solution to the problem of scheduling delay-sensitive media data for transmission over time-varying wireless channels. We first formulate th...
Fangwen Fu, Mihaela van der Schaar
51
Voted
CORR
2010
Springer
66views Education» more  CORR 2010»
14 years 8 months ago
Three-Level Parallel J-Jacobi Algorithms for Hermitian Matrices
The paper describes several efficient parallel implementations of the one-sided hyperbolic Jacobi-type algorithm for computing eigenvalues and eigenvectors of Hermitian matrices. ...
Sanja Singer, Sasa Singer, Vedran Novakovic, Davor...
64
Voted
CORR
2010
Springer
153views Education» more  CORR 2010»
14 years 8 months ago
Approximate Judgement Aggregation
We analyze judgement aggregation problems in which a group of agents independently votes on a set of complex propositions that has some interdependency constraint between them (e....
Ilan Nehama
CORR
2010
Springer
165views Education» more  CORR 2010»
14 years 8 months ago
Monte Carlo Methods for Top-k Personalized PageRank Lists and Name Disambiguation
We study a problem of quick detection of top-k Personalized PageRank lists. This problem has a number of important applications such as finding local cuts in large graphs, estima...
Konstantin Avrachenkov, Nelly Litvak, Danil Nemiro...
CORR
2010
Springer
107views Education» more  CORR 2010»
14 years 8 months ago
Maximum Betweenness Centrality: Approximability and Tractable Cases
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
Martin Fink, Joachim Spoerhase
CORR
2010
Springer
114views Education» more  CORR 2010»
14 years 8 months ago
On weakly optimal partitions in modular networks
Abstract. Modularity was introduced as a measure of goodness for the community structure induced by a partition of the set of vertices in a graph. Then, it also became an objective...
José Ignacio Alvarez-Hamelin, Beiró ...
CORR
2010
Springer
162views Education» more  CORR 2010»
14 years 8 months ago
Networked Computing in Wireless Sensor Networks for Structural Health Monitoring
Abstract—This paper studies the problem of distributed computation over a network of wireless sensors. While this problem applies to many emerging applications, to keep our discu...
Apoorva Jindal, Mingyan Liu
36
Voted
CORR
2010
Springer
45views Education» more  CORR 2010»
14 years 8 months ago
The Shannon Cipher System with a Guessing Wiretapper: General Sources
Manjesh Kumar Hanawal, Rajesh Sundaresan
CORR
2010
Springer
121views Education» more  CORR 2010»
14 years 8 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