Sciweavers

7913 search results - page 1475 / 1583
» Information Collection on a Graph
Sort
View
BMCBI
2007
160views more  BMCBI 2007»
15 years 6 months ago
Identifying protein complexes directly from high-throughput TAP data with Markov random fields
Background: Predicting protein complexes from experimental data remains a challenge due to limited resolution and stochastic errors of high-throughput methods. Current algorithms ...
Wasinee Rungsarityotin, Roland Krause, Arno Sch&ou...
CORR
2010
Springer
152views Education» more  CORR 2010»
15 years 6 months ago
Deploying Wireless Networks with Beeps
Abstract. We present the discrete beeping communication model, which assumes nodes have minimal knowledge about their environment and severely limited communication capabilities. S...
Alejandro Cornejo, Fabian Kuhn

Publication
167views
15 years 6 months ago
A Network Coding Approach to IP Traceback
Traceback schemes aim at identifying the source(s) of a sequence of packets and the nodes these packets traversed. This is useful for tracing the sources of high volume traffic, e...
Pegah Sattari, Minas Gjoka, Athina Markopoulou
DKE
2007
130views more  DKE 2007»
15 years 6 months ago
Enabling access-privacy for random walk based data analysis applications
Random walk graph and Markov chain based models are used heavily in many data and system analysis domains, including web, bioinformatics, and queuing. These models enable the desc...
Ping Lin, K. Selçuk Candan
MST
2006
104views more  MST 2006»
15 years 6 months ago
Sequencing from Compomers: The Puzzle
The board game FragmindTM poses the following problem: The player has to reconstruct an (unknown) string s over the alphabet . To this end, the game reports the following informati...
Sebastian Böcker
« Prev « First page 1475 / 1583 Last » Next »