Sciweavers

723 search results - page 144 / 145
» On the hyperbolicity constant in graphs
Sort
View
TSP
2008
101views more  TSP 2008»
13 years 7 months ago
Optimal Node Density for Detection in Energy-Constrained Random Networks
The problem of optimal node density maximizing the Neyman-Pearson detection error exponent subject to a constraint on average (per node) energy consumption is analyzed. The spatial...
Animashree Anandkumar, Lang Tong, Ananthram Swami
JACM
2000
131views more  JACM 2000»
13 years 7 months ago
The soft heap: an approximate priority queue with optimal error rate
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
Bernard Chazelle
KBSE
2010
IEEE
13 years 5 months ago
Test generation to expose changes in evolving programs
Software constantly undergoes changes throughout its life cycle, and thereby it evolves. As changes are introduced into a code base, we need to make sure that the effect of the ch...
Dawei Qi, Abhik Roychoudhury, Zhenkai Liang
VIROLOGY
2010
179views more  VIROLOGY 2010»
13 years 5 months ago
Automatic binary deobfuscation
Abstract. This paper gives an overview of our research in the automation of the process of software protection analysis. We will focus more particularly on the problem of obfuscati...
Yoann Guillot, Alexandre Gazet
CORR
2011
Springer
159views Education» more  CORR 2011»
13 years 2 months ago
How to Play Unique Games against a Semi-Random Adversary
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...
Alexandra Kolla, Konstantin Makarychev, Yury Makar...