Sciweavers

3055 search results - page 185 / 611
» Randomized Search Trees
Sort
View
147
Voted
PIMRC
2008
IEEE
15 years 7 months ago
Dynamic data aggregation and transport in wireless sensor networks
—In wireless sensor networks, in-network aggregation is the process of compressing locally the data gathered by the sensor nodes, so that only the compressed data travel across s...
Mario O. Diaz, Kin K. Leung
ALIFE
2004
15 years 18 days ago
Using Avida to Test the Effects of Natural Selection on Phylogenetic Reconstruction Methods
Phylogenetic trees group organisms by their ancestral relationships. There are a number of distinct algorithms used to reconstruct these trees from molecular sequence data, but dif...
George I. Hagstrom, Dehua H. Hang, Charles Ofria, ...
86
Voted
ICC
2007
IEEE
15 years 7 months ago
Opportunistic Power Allocation for Random Beamforming in MISO Broadcast Channels
Abstract— This paper proposes the opportunistic power allocation (OPA) scheme for random beamforming with a limited feedback rate. Without the channel state information, the prop...
Edward W. Jang, Hyukjoon Kwon, John M. Cioffi
ICPR
2006
IEEE
15 years 6 months ago
A Conditional Random Field Model for Video Super-resolution
In this paper, we propose a learning-based method for video super-resolution. There are two main contributions of the proposed method. First, information from cameras with differe...
Dan Kong, Mei Han, Wei Xu, Hai Tao, Yihong Gong
100
Voted
SAT
2005
Springer
95views Hardware» more  SAT 2005»
15 years 6 months ago
Random Walk with Continuously Smoothed Variable Weights
Many current local search algorithms for SAT fall into one of two classes. Random walk algorithms such as Walksat/SKC, Novelty+ and HWSAT are very successful but can be trapped for...
Steven David Prestwich