Sciweavers

2310 search results - page 267 / 462
» Coloring Random Graphs
Sort
View
INFOCOM
2008
IEEE
14 years 2 months ago
Randomized 3D Geographic Routing
—We reconsider the problem of geographic routing in wireless ad hoc networks. We are interested in local, memoryless routing algorithms, i.e. each network node bases its routing ...
Roland Flury, Roger Wattenhofer
CVPR
2010
IEEE
14 years 1 months ago
Semantic Context Modeling with Maximal Margin Conditional Random Fields for Automatic Image Annotation
Context modeling for Vision Recognition and Automatic Image Annotation (AIA) has attracted increasing attentions in recent years. For various contextual information and resources,...
Yu Xiang, Xiangdong Zhou, Zuotao Liu, Tat-seng chu...
COCO
1994
Springer
140views Algorithms» more  COCO 1994»
14 years 9 days ago
Random Debaters and the Hardness of Approximating Stochastic Functions
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter ...
BMCBI
2007
160views more  BMCBI 2007»
13 years 8 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...
DKE
2007
130views more  DKE 2007»
13 years 8 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