Sciweavers

1568 search results - page 241 / 314
» The problem of examination questions in algorithmics
Sort
View
WDAG
2009
Springer
160views Algorithms» more  WDAG 2009»
15 years 8 months ago
Brief Announcement: The Minimum Failure Detector for Non-Local Tasks in Message-Passing Systems
This paper defines the basic notions of local and non-local tasks, and determines the minimum information about failures that is necessary to solve any non-local task in message-p...
Carole Delporte-Gallet, Hugues Fauconnier, Sam Tou...
RECOMB
2008
Springer
16 years 4 months ago
Constructing Treatment Portfolios Using Affinity Propagation
A key problem of interest to biologists and medical researchers is the selection of a subset of queries or treatments that provide maximum utility for a population of targets. For ...
Delbert Dueck, Brendan J. Frey, Nebojsa Jojic, Vla...
DIALM
2005
ACM
130views Algorithms» more  DIALM 2005»
15 years 6 months ago
On lower bounds for MAC layer contention in CSMA/CA-based wireless networks
Wireless LANs operating within unlicensed frequency bands require random access schemes such as CSMA/CA, so that wireless networks from different administrative domains (for exam...
Frank A. Zdarsky, Ivan Martinovic, Jens B. Schmitt
BMCBI
2008
160views more  BMCBI 2008»
15 years 4 months ago
Feature selection environment for genomic applications
Background: Feature selection is a pattern recognition approach to choose important variables according to some criteria in order to distinguish or explain certain phenomena (i.e....
Fabrício Martins Lopes, David Correa Martin...
SIAMMAX
2010
164views more  SIAMMAX 2010»
14 years 11 months ago
Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...
Amit Singer, Mihai Cucuringu