Sciweavers

11371 search results - page 1983 / 2275
» The network inhibition problem
Sort
View
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
15 years 8 months ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe
BMCBI
2010
175views more  BMCBI 2010»
15 years 7 months ago
The BridgeDb framework: standardized access to gene, protein and metabolite identifier mapping services
Background: Many complementary solutions are available for the identifier mapping problem. This creates an opportunity for bioinformatics tool developers. Tools can be made to fle...
Martijn P. van Iersel, Alexander R. Pico, Thomas K...
BMCBI
2008
166views more  BMCBI 2008»
15 years 7 months ago
Biclustering via optimal re-ordering of data matrices in systems biology: rigorous methods and comparative studies
Background: The analysis of large-scale data sets via clustering techniques is utilized in a number of applications. Biclustering in particular has emerged as an important problem...
Peter A. DiMaggio Jr., Scott R. McAllister, Christ...
CN
2010
149views more  CN 2010»
15 years 7 months ago
A collaborative P2P scheme for NAT Traversal Server discovery based on topological information
In the current Internet picture more than 70% of the hosts are located behind Network Address Translators (NATs). This is not a problem in the client/server paradigm. However, the...
Rubén Cuevas Rumín, Ángel Cue...
CORR
2010
Springer
338views Education» more  CORR 2010»
15 years 7 months ago
Optimal Distributed P2P Streaming under Node Degree Bounds
We study the problem of maximizing the broadcast rate in peer-to-peer (P2P) systems under node degree bounds, i.e., the number of neighbors a node can simultaneously connect to is ...
Shaoquan Zhang, Ziyu Shao, Minghua Chen
« Prev « First page 1983 / 2275 Last » Next »