Sciweavers

5580 search results - page 725 / 1116
» Randomized priority algorithms
Sort
View
INFOCOM
2005
IEEE
15 years 9 months ago
Time and energy complexity of distributed computation in wireless sensor networks
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
Nilesh Khude, Anurag Kumar, Aditya Karnik
ESA
1995
Springer
182views Algorithms» more  ESA 1995»
15 years 7 months ago
A Geometric Approach to Betweenness
An input to the betweenness problem contains m constraints over n real variables (points). Each constraint consists of three points, where one of the points is specified to lie in...
Benny Chor, Madhu Sudan
136
Voted
ATAL
2008
Springer
15 years 6 months ago
Approximating power indices
Many multiagent domains where cooperation among agents is crucial to achieving a common goal can be modeled as coalitional games. However, in many of these domains, agents are une...
Yoram Bachrach, Evangelos Markakis, Ariel D. Proca...
136
Voted
SODA
2003
ACM
119views Algorithms» more  SODA 2003»
15 years 5 months ago
Simultaneous optimization for concave costs: single sink aggregation or single source buy-at-bulk
We consider the problem of finding efficient trees to send information from k sources to a single sink in a network where information can be aggregated at intermediate nodes in t...
Ashish Goel, Deborah Estrin
BMCBI
2007
148views more  BMCBI 2007»
15 years 4 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...