Sciweavers

2531 search results - page 145 / 507
» Group testing in graphs
Sort
View
SPAA
2000
ACM
15 years 9 months ago
An experimental study of a simple, distributed edge coloring algorithm
We conduct an experimental analysis of a distributed, randomized algorithm for edge coloring graphs. The algorithm is extremely simple, yet, according to the probabilistic analysi...
Madhav V. Marathe, Alessandro Panconesi, Larry D. ...
NIPS
2008
15 years 6 months ago
Bayesian Network Score Approximation using a Metagraph Kernel
Many interesting problems, including Bayesian network structure-search, can be cast in terms of finding the optimum value of a function over the space of graphs. However, this fun...
Benjamin Yackley, Eduardo Corona, Terran Lane
ECCV
2008
Springer
16 years 7 months ago
Modeling and Recognition of Landmark Image Collections Using Iconic Scene Graphs
This paper presents an approach for modeling landmark sites such as the Statue of Liberty based on large-scale contaminated image collections gathered from the Internet. Our system...
Xiaowei Li, Changchang Wu, Christopher Zach, Svetl...
BMCBI
2007
150views more  BMCBI 2007»
15 years 5 months ago
Refining intra-protein contact prediction by graph analysis
Background: Accurate prediction of intra-protein residue contacts from sequence information will allow the prediction of protein structures. Basic predictions of such specific con...
Milana Frenkel-Morgenstern, Rachel Magid, Eran Eya...
AFRIGRAPH
2001
ACM
15 years 8 months ago
Exploiting coherence of shadow rays
We present independent method to reduce the number of shadow ray tests. It can be used with standard acceleration ray tracing algorithms. Our method is conservative and produces t...
Andrzej Lukaszewski