Sciweavers

1089 search results - page 171 / 218
» Bounds on generalized Frobenius numbers
Sort
View
CCS
2008
ACM
13 years 11 months ago
Dependent link padding algorithms for low latency anonymity systems
Low latency anonymity systems are susceptive to traffic analysis attacks. In this paper, we propose a dependent link padding scheme to protect anonymity systems from traffic analy...
Wei Wang 0002, Mehul Motani, Vikram Srinivasan
DIALM
2008
ACM
135views Algorithms» more  DIALM 2008»
13 years 10 months ago
Symmetric range assignment with disjoint MST constraints
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
Eric Schmutz
ECAI
2008
Springer
13 years 10 months ago
Optimal Coalition Structure Generation In Partition Function Games
1 In multi-agent systems (MAS), coalition formation is typically studied using characteristic function game (CFG) representations, where the performance of any coalition is indepen...
Tomasz P. Michalak, Andrew Dowell, Peter McBurney,...
AAAI
2010
13 years 10 months ago
Coalitional Structure Generation in Skill Games
We consider optimizing the coalition structure in Coalitional Skill Games (CSGs), a succinct representation of coalitional games (Bachrach and Rosenschein 2008). In CSGs, the valu...
Yoram Bachrach, Reshef Meir, Kyomin Jung, Pushmeet...
SDM
2008
SIAM
139views Data Mining» more  SDM 2008»
13 years 10 months ago
Maximal Quasi-Bicliques with Balanced Noise Tolerance: Concepts and Co-clustering Applications
The rigid all-versus-all adjacency required by a maximal biclique for its two vertex sets is extremely vulnerable to missing data. In the past, several types of quasi-bicliques ha...
Jinyan Li, Kelvin Sim, Guimei Liu, Limsoon Wong