Sciweavers

2354 search results - page 347 / 471
» Randomness, Stochasticity and Approximations
Sort
View
COCOON
2005
Springer
15 years 11 months ago
Construction of Scale-Free Networks with Partial Information
It has recently been observed that the node degrees of many real-world large-scale networks, such as the Internet and the Web, follow a power law distributions. Since the classical...
Jianyang Zeng, Wen-Jing Hsu, Suiping Zhou
MOBICOM
2004
ACM
15 years 11 months ago
Modeling mobility for vehicular ad-hoc networks
Without realistic modeling of node mobility, simulation evaluation of performance of mobile ad hoc networks may not correlate well with performance in a real deployment. In this p...
Amit Kumar Saha, David B. Johnson
APPROX
2004
Springer
136views Algorithms» more  APPROX 2004»
15 years 11 months ago
On the Crossing Spanning Tree Problem
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
Vittorio Bilò, Vineet Goyal, R. Ravi, Mohit...
ICPR
2010
IEEE
15 years 11 months ago
Motif Discovery and Feature Selection for CRF-Based Activity Recognition
Abstract—Due to their ability to model sequential data without making unnecessary independence assumptions, conditional random fields (CRFs) have become an increasingly popular ...
Liyue Zhao, Xi Wang, Gita Sukthankar
CSB
2003
IEEE
15 years 11 months ago
Initial Large-scale Exploration of Protein-protein Interactions in Human Brain
Study of protein interaction networks is crucial to post-genomic systems biology. Aided by highthroughput screening technologies, biologists are rapidly accumulating protein-prote...
Jake Yue Chen, Andrey Y. Sivachenko, Russell Bell,...