Sciweavers

2304 search results - page 66 / 461
» On the Vulnerability of Large Graphs
Sort
View
SAC
2009
ACM
15 years 6 months ago
Visualization of information flows in a very large social network
In this paper, we present our research result that enables users to navigate a very large social network and to take a look at information flows on the network. To this end, we d...
Shin Gyu Kim, Hyuck Han, Kyungho Jeon, Hyungsoo Ju...
STOC
2010
ACM
211views Algorithms» more  STOC 2010»
15 years 9 months ago
Maintaining a Large Matching or a Small Vertex Cover
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge ins...
Krzysztof Onak and Ronitt Rubinfeld
ISCSCT
2008
IEEE
15 years 6 months ago
Large Scale Scenes Reconstruction from Multiple Views
—In this paper, we present a novel method to reconstruct the large scale scenes from multiple calibrated images. It first generates a quasi-dense 3D point cloud of the scene by m...
Limin Shi, Feng Zhang, Zhenhui Xu, Zhanyi Hu
SPDP
1990
IEEE
15 years 3 months ago
A semi distributed load balancing scheme for large multicomputer systems
In this paper, we propose a semi distributed approach, for load balancing in large parallel and distributedsystems. Theproposedschemeisa twolevel hierarchical scheme which partiti...
Ishfaq Ahmad, Arif Ghafoor
TCAD
2008
97views more  TCAD 2008»
14 years 11 months ago
Encoding Large Asynchronous Controllers With ILP Techniques
State encoding is one of the most difficult problems in the synthesis of asynchronous controllers. This paper presents a method that can solve the problem of large controllers spec...
Josep Carmona, Jordi Cortadella