Sciweavers

2084 search results - page 373 / 417
» Proving Time Bounds for Randomized Distributed Algorithms
Sort
View
83
Voted
PIMRC
2010
IEEE
14 years 7 months ago
On the feasibility of receive collaboration in wireless sensor networks
In this paper, a new type of collaboration in wireless sensor networks (WSN) is suggested that exploits array processing algorithms for better reception of a signal. For receive co...
Behnam Banitalebi, S. Sigg, M. Beigl
76
Voted
IPPS
2008
IEEE
15 years 4 months ago
Heterogenous dating service with application to rumor spreading
Peer-to-Peer overlay networks have proven their efficiency for storing and retrieving data at large scale, but new services are required to take the actual performances of resour...
Olivier Beaumont, Philippe Duchon, Miroslaw Korzen...
ICPPW
2007
IEEE
15 years 4 months ago
Power Management of Multicore Multiple Voltage Embedded Systems by Task Scheduling
We study the role of task-level scheduling in power management on multicore multiple voltage embedded systems. Multicore on-achip, in particular DSP systems, can greatly improve p...
Gang Qu
CIVR
2007
Springer
180views Image Analysis» more  CIVR 2007»
15 years 3 months ago
Probabilistic matching and resemblance evaluation of shapes in trademark images
We present a novel matching and similarity evaluation method for planar geometric shapes represented by sets of polygonal curves. Given two shapes, the matching algorithm randomly...
Helmut Alt, Ludmila Scharf, Sven Scholz
BMCBI
2007
148views more  BMCBI 2007»
14 years 9 months ago
Computation of significance scores of unweighted Gene Set Enrichment Analyses
Background: Gene Set Enrichment Analysis (GSEA) is a computational method for the statistical evaluation of sorted lists of genes or proteins. Originally GSEA was developed for in...
Andreas Keller, Christina Backes, Hans-Peter Lenho...