Sciweavers

389 search results - page 14 / 78
» Computational Alternatives to Random Number Generators
Sort
View
ADHOCNOW
2004
Springer
14 years 2 months ago
Approximating the Minimum Number of Maximum Power Users in Ad Hoc Networks
Topology control is the problem of assigning transmission power values to the nodes of an ad hoc network so that the induced graph satisfies some specified property. The most fun...
Errol L. Lloyd, Rui Liu, S. S. Ravi
PAMI
2010
396views more  PAMI 2010»
13 years 7 months ago
Self-Validated Labeling of Markov Random Fields for Image Segmentation
—This paper addresses the problem of self-validated labeling of Markov random fields (MRFs), namely to optimize an MRF with unknown number of labels. We present graduated graph c...
Wei Feng, Jiaya Jia, Zhi-Qiang Liu
EUC
2007
Springer
14 years 2 months ago
Attack-Resilient Random Key Distribution Scheme for Distributed Sensor Networks
Abstract. Key pre-distribution schemes are a favored solution for establishing secure communication in sensor networks. Often viewed as the safest way to bootstrap trust, the main ...
Firdous Kausar, Sajid Hussain, Tai-Hoon Kim, Ashra...
CVBIA
2005
Springer
14 years 2 months ago
Segmenting Brain Tumors with Conditional Random Fields and Support Vector Machines
Abstract. Markov Random Fields (MRFs) are a popular and wellmotivated model for many medical image processing tasks such as segmentation. Discriminative Random Fields (DRFs), a dis...
Chi-Hoon Lee, Mark Schmidt, Albert Murtha, Aalo Bi...
CLUSTER
2006
IEEE
14 years 2 months ago
A Simple Synchronous Distributed-Memory Algorithm for the HPCC RandomAccess Benchmark
The RandomAccess benchmark as defined by the High Performance Computing Challenge (HPCC) tests the speed at which a machine can update the elements of a table spread across globa...
Steven J. Plimpton, Ron Brightwell, Courtenay Vaug...