Sciweavers

608 search results - page 92 / 122
» Random Systems with Complete Connections
Sort
View
JSW
2007
106views more  JSW 2007»
13 years 9 months ago
Destabilization of Terrorist Networks through Argument Driven Hypothesis Model
— Social network analysis has been used for quite some time to analyze and understand the behavior of nodes in the network. Theses nodes could be individuals or group of persons,...
Dil Muhammad Akbar Hussain
JCO
2010
101views more  JCO 2010»
13 years 8 months ago
Separator-based data reduction for signed graph balancing
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
Falk Hüffner, Nadja Betzler, Rolf Niedermeier
AAAI
2011
12 years 9 months ago
Exploiting Phase Transition in Latent Networks for Clustering
In this paper, we model the pair-wise similarities of a set of documents as a weighted network with a single cutoff parameter. Such a network can be thought of an ensemble of unwe...
Vahed Qazvinian, Dragomir R. Radev
ICPPW
2008
IEEE
14 years 4 months ago
Non-Contiguous I/O Support for Object-Based Storage
The access patterns performed by disk-intensive applications vary widely, from simple contiguous reads or writes through an entire file to completely unpredictable random access....
Dennis Dalessandro, Ananth Devulapalli, Pete Wycko...
MOBIHOC
2009
ACM
14 years 10 months ago
Efficient resource management in OFDMA Femto cells
Femto cells are a cost-effective means of providing ubiquitous connectivity in future broadband wireless networks. While their primary purpose has been to improve coverage in curr...
Karthikeyan Sundaresan, Sampath Rangarajan