Sciweavers

9532 search results - page 1638 / 1907
» Logic, Graphs, and Algorithms
Sort
View
BMCBI
2010
142views more  BMCBI 2010»
15 years 6 months ago
Discover Protein Complexes in Protein-Protein Interaction Networks Using Parametric Local Modularity
Background: Recent advances in proteomic technologies have enabled us to create detailed protein-protein interaction maps in multiple species and in both normal and diseased cells...
Jongkwang Kim, Kai Tan
PAMI
2008
198views more  PAMI 2008»
15 years 6 months ago
A Comparative Study of Energy Minimization Methods for Markov Random Fields with Smoothness-Based Priors
Among the most exciting advances in early vision has been the development of efficient energy minimization algorithms for pixel-labeling tasks such as depth or texture computation....
Richard Szeliski, Ramin Zabih, Daniel Scharstein, ...
CORR
2011
Springer
159views Education» more  CORR 2011»
15 years 1 months ago
How to Play Unique Games against a Semi-Random Adversary
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...
Alexandra Kolla, Konstantin Makarychev, Yury Makar...
WWW
2011
ACM
15 years 1 months ago
Finding the bias and prestige of nodes in networks based on trust scores
Many real-life graphs such as social networks and peer-topeer networks capture the relationships among the nodes by using trust scores to label the edges. Important usage of such ...
Abhinav Mishra, Arnab Bhattacharya
AAAI
2012
13 years 9 months ago
Dynamic Matching via Weighted Myopia with Application to Kidney Exchange
In many dynamic matching applications—especially high-stakes ones—the competitive ratios of prior-free online algorithms are unacceptably poor. The algorithm should take distr...
John P. Dickerson, Ariel D. Procaccia, Tuomas Sand...
« Prev « First page 1638 / 1907 Last » Next »