Sciweavers

GLOBECOM
2010
IEEE
13 years 9 months ago
Routing and Scheduling in Distributed Advance Reservation Networks
Advance reservation of connection requests is a growing focus area and a range of solutions have been proposed. However, most efforts here have focused on scheduling algorithm desi...
Chongyang Xie, Hamad Alazemi, Nasir Ghani
ACSAC
2010
IEEE
13 years 9 months ago
G-Free: defeating return-oriented programming through gadget-less binaries
Despite the numerous prevention and protection mechanisms that have been introduced into modern operating systems, the exploitation of memory corruption vulnerabilities still repr...
Kaan Onarlioglu, Leyla Bilge, Andrea Lanzi, Davide...
ACSAC
2010
IEEE
13 years 9 months ago
Keeping data secret under full compromise using porter devices
We address the problem of confidentiality in scenarios where the attacker is not only able to observe the communication between principals, but can also fully compromise the commu...
Christina Pöpper, David A. Basin, Srdjan Capk...
CJ
2010
87views more  CJ 2010»
13 years 10 months ago
Resource-Aware Multimedia Content Delivery: A Gambling Approach
In this paper, we propose a resource-aware solution to achieving reliable and scalable stream diffusion in a probabilistic model, i.e., where communication links and processes are...
Mouna Allani, Benoît Garbinato, Fernando Ped...
AMC
2010
132views more  AMC 2010»
13 years 10 months ago
A note on "New kink-shaped solutions and periodic wave solutions for the (2 + 1)-dimensional Sine-Gordon equation"
Exact solutions of the Nizhnik-Novikov-Veselov equation by Li [New kink-shaped solutions and periodic wave solutions for the (2+1)-dimensional Sine-Gordon equation, Appl. Math. Co...
Nikolay A. Kudryashov, Pavel N. Ryabov, Dmitry I. ...
SAGT
2010
Springer
200views Game Theory» more  SAGT 2010»
13 years 10 months ago
2-Player Nash and Nonsymmetric Bargaining Games: Algorithms and Structural Properties
The solution to a Nash or a nonsymmetric bargaining game is obtained by maximizing a concave function over a convex set, i.e., it is the solution to a convex program. We show that...
Vijay V. Vazirani
MP
2010
119views more  MP 2010»
13 years 10 months ago
Efficient and fair routing for mesh networks
Inspired by the One Laptop Per Child project, we consider mesh networks that connect devices that cannot recharge their batteries easily. We study how the mesh should retransmit in...
Andrea Lodi, Enrico Malaguti, Nicolás E. St...
MOR
2010
98views more  MOR 2010»
13 years 10 months ago
Sharing the Cost of a Capacity Network
We consider a communication network where each pair of users requests a connection guaranteeing a certain capacity. The cost of building capacity is identical across pairs. E cien...
Anna Bogomolnaia, Ron Holzman, Hervé Moulin
MODELS
2010
Springer
13 years 10 months ago
A Dynamic-Priority Based Approach to Fixing Inconsistent Feature Models
In feature models’ construction, one basic task is to ensure the consistency of feature models, which often involves detecting and fixing of inconsistencies in feature models. S...
Bo Wang, Yingfei Xiong, Zhenjiang Hu, Haiyan Zhao,...
JNS
2010
62views more  JNS 2010»
13 years 10 months ago
On the Existence of Quasipattern Solutions of the Swift-Hohenberg Equation
Quasipatterns (two-dimensional patterns that are quasiperiodic in any spatial direction) remain one of the outstanding problems of pattern formation. As with problems involving qu...
G. Iooss, A. M. Rucklidge