Sciweavers

715 search results - page 48 / 143
» On graphs with subgraphs having large independence numbers
Sort
View
CORR
2007
Springer
87views Education» more  CORR 2007»
13 years 8 months ago
Detection of Gauss-Markov Random Fields with Nearest-Neighbor Dependency
Abstract—The problem of hypothesis testing against independence for a Gauss–Markov random field (GMRF) is analyzed. Assuming an acyclic dependency graph, an expression for the...
Animashree Anandkumar, Lang Tong, Ananthram Swami
COMBINATORICA
2008
92views more  COMBINATORICA 2008»
13 years 9 months ago
A separation theorem in property testing
Consider the following seemingly rhetorical question: Is it crucial for a property-tester to know the error parameter in advance? Previous papers dealing with various testing prob...
Noga Alon, Asaf Shapira
BMCBI
2005
253views more  BMCBI 2005»
13 years 8 months ago
The Use of Edge-Betweenness Clustering to Investigate Biological Function in Protein Interaction Networks
Background: This paper describes an automated method for finding clusters of interconnected proteins in protein interaction networks and retrieving protein annotations associated ...
Ruth Dunn, Frank Dudbridge, Christopher M. Sanders...
COMGEO
2007
ACM
13 years 8 months ago
Graph drawings with few slopes
The slope-number of a graph G is the minimum number of distinct edge slopes in a straight-line drawing of G in the plane. We prove that for Δ 5 and all large n, there is a Δ-reg...
Vida Dujmovic, Matthew Suderman, David R. Wood
SIGUCCS
2000
ACM
14 years 1 months ago
Implementing LIES (Location Independent Email Service)
This paper will provide a useful guide to those schools that have not yet implemented IMAP and are considering doing so. With both the systems and user services perspectives, any ...
Pamela Vogel, John Spadaro