Sciweavers

3495 search results - page 148 / 699
» On the random satisfiable process
Sort
View
BMCBI
2008
95views more  BMCBI 2008»
15 years 4 months ago
Unsupervised reduction of random noise in complex data by a row-specific, sorted principal component-guided method
Background: Large biological data sets, such as expression profiles, benefit from reduction of random noise. Principal component (PC) analysis has been used for this purpose, but ...
Joseph W. Foley, Fumiaki Katagiri
SPIEVIP
2008
15 years 6 months ago
Adaptive methods of two-scale edge detection in post-enhancement visual pattern processing
Adaptive methods are defined and experimentally studied for a two-scale edge detection process that mimics human visual perception of edges and is inspired by the parvo-cellular (...
Zia-ur Rahman, Daniel J. Jobson, Glenn A. Woodell
SAC
2010
ACM
15 years 11 months ago
Asynchronous Byzantine consensus with 2f+1 processes
Byzantine consensus in asynchronous message-passing systems has been shown to require at least 3f + 1 processes to be solvable in several system models (e.g., with failure detecto...
Miguel Correia, Giuliana Santos Veronese, Lau Cheu...
SIGMETRICS
2010
ACM
197views Hardware» more  SIGMETRICS 2010»
15 years 9 months ago
Coloring spatial point processes with applications to peer discovery in large wireless networks
In this paper, we study distributed channel assignment in wireless networks with applications to peer discovery in ad hoc wireless networks. We model channel assignment as a color...
Jian Ni, R. Srikant, Xinzhou Wu
DCOSS
2006
Springer
15 years 8 months ago
Efficient In-Network Processing Through Local Ad-Hoc Information Coalescence
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
Onur Savas, Murat Alanyali, Venkatesh Saligrama