Sciweavers

2131 search results - page 136 / 427
» Immunity for Closed Sets
Sort
View
GD
2005
Springer
15 years 12 months ago
Fast Node Overlap Removal
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
Tim Dwyer, Kim Marriott, Peter J. Stuckey
ICNP
2003
IEEE
15 years 11 months ago
Distributed, Self-Stabilizing Placement of Replicated Resources in Emerging Networks
Emerging large scale distributed networking systems, such as P2P file sharing systems, sensor networks, and ad hoc wireless networks, require replication of content, functionalit...
Bong-Jun Ko, Dan Rubenstein
GROUP
2003
ACM
15 years 11 months ago
Communities of action: a cognitive and social approach to the design of CSCW systems
Most current theories about collective cognitive activities in limited groups apply to structurally closed co-operative situations Here we propose to work in the framework of inte...
Manuel Zacklad
PAKDD
2010
ACM
117views Data Mining» more  PAKDD 2010»
15 years 11 months ago
BASSET: Scalable Gateway Finder in Large Graphs
Given a social network, who is the best person to introduce you to, say, Chris Ferguson, the poker champion? Or, given a network of people and skills, who is the best person to he...
Hanghang Tong, Spiros Papadimitriou, Christos Falo...
FOCS
2009
IEEE
15 years 10 months ago
Optimal Quantum Strong Coin Flipping
Coin flipping is a fundamental cryptographic primitive that enables two distrustful and far apart parties to create a uniformly random bit [Blu81]. Quantum information allows for ...
André Chailloux, Iordanis Kerenidis