Sciweavers

46 search results - page 5 / 10
» An exact almost optimal algorithm for target set selection i...
Sort
View
CN
1998
64views more  CN 1998»
13 years 7 months ago
Decentralized Network Connection Preemption Algorithms
Connection preemption provides available and reliable services to high-priority connections when a network is heavily loaded and connection request arrival patterns are unknown, o...
Mohammad Peyravian, Ajay D. Kshemkalyani
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
12 years 10 months ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...
COMPGEOM
2006
ACM
14 years 1 months ago
Minimum-cost coverage of point sets by disks
We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (tj) and radii (rj) that cover a given set of...
Helmut Alt, Esther M. Arkin, Hervé Brö...
ISM
2008
IEEE
111views Multimedia» more  ISM 2008»
14 years 1 months ago
Secure and Low Cost Selective Encryption for JPEG2000
Selective encryption is a new trend in content protection. It aims at reducing the amount of data to encrypt while achieving a sufficient and inexpensive security. This approach ...
Ayoub Massoudi, Frédéric Lefè...
GECCO
2008
Springer
143views Optimization» more  GECCO 2008»
13 years 8 months ago
How social structure and institutional order co-evolve beyond instrumental rationality
This study proposes an agent-based model where adaptively learning agents with local vision who are situated in the Prisoner’s Dilemma game change their strategy and location as...
Jae-Woo Kim