Sciweavers

CORR
2010
Springer
142views Education» more  CORR 2010»
13 years 8 months ago
HyperANF: Approximating the Neighbourhood Function of Very Large Graphs on a Budget
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
Paolo Boldi, Marco Rosa, Sebastiano Vigna
CORR
2010
Springer
86views Education» more  CORR 2010»
13 years 8 months ago
Secure Multiparty Computation with Partial Fairness
A protocol for computing a functionality is secure if an adversary in this protocol cannot cause more harm than in an ideal computation where parties give their inputs to a truste...
Amos Beimel, Eran Omri, Ilan Orlov
CORR
2010
Springer
87views Education» more  CORR 2010»
13 years 8 months ago
Using Evolution Strategy with Meta-models for Well Placement Optimization
Optimum implementation of non-conventional wells allows us to increase considerably hydrocarbon recovery. By considering the high drilling cost and the potential improvement in we...
Zyed Bouzarkouna, Didier Yu Ding, Anne Auger
CORR
2010
Springer
101views Education» more  CORR 2010»
13 years 8 months ago
Spectrum Sharing as Spatial Congestion Games
—In this paper, we present and analyze the properties of a new class of games - the spatial congestion game (SCG), which is a generalization of the classical congestion game (CG)...
Sahand Haji Ali Ahmad, Cem Tekin, Mingyan Liu, Ric...
CORR
2010
Springer
215views Education» more  CORR 2010»
13 years 8 months ago
Energy Efficient Clustering and Routing in Mobile Wireless Sensor Network
A critical need in Mobile Wireless Sensor Network (MWSN) is to achieve energy efficiency during routing as the sensor nodes have scarce energy resource. The nodes’ mobility in M...
Getsy S. Sara, Kalaiarasi R, Neelavathy Pari S, Sr...
CORR
2010
Springer
147views Education» more  CORR 2010»
13 years 8 months ago
Strong direct product theorems for quantum communication and query complexity
A strong direct product theorem (SDPT) states that solving n instances of a problem requires ˝.n/ times the resources for a single instance, even to achieve success probability 2 ...
Alexander A. Sherstov
CORR
2010
Springer
97views Education» more  CORR 2010»
13 years 8 months ago
Towards a Collision-Free WLAN: Dynamic Parameter Adjustment in CSMA/E2CA
Abstract—Carrier Sense Multiple Access with Enhanced Collision Avoidance (CSMA/ECA) is a distributed MAC protocol that allows collision-free access to the medium in WLAN. The onl...
Jaume Barceló, Boris Bellalta, Cristina Can...
CORR
2010
Springer
92views Education» more  CORR 2010»
13 years 8 months ago
Random Projections for $k$-means Clustering
This paper discusses the topic of dimensionality reduction for k-means clustering. We prove that any set of n points in d dimensions (rows in a matrix A ∈ Rn×d ) can be project...
Christos Boutsidis, Anastasios Zouzias, Petros Dri...
CORR
2010
Springer
171views Education» more  CORR 2010»
13 years 8 months ago
Graphical Models Concepts in Compressed Sensing
This paper surveys recent work in applying ideas from graphical models and message passing algorithms to solve large scale regularized regression problems. In particular, the focu...
Andrea Montanari
CORR
2010
Springer
116views Education» more  CORR 2010»
13 years 8 months ago
Progressive Decoding for Data Availability and Reliability in Distributed Networked Storage
—To harness the ever growing capacity and decreasing cost of storage, providing an abstraction of dependable storage in the presence of crash-stop and Byzantine failures is compu...
Yunghsiang Han, Soji Omiwade, Rong Zheng