Sciweavers

3757 search results - page 533 / 752
» The overlap number of a graph
Sort
View
STOC
2009
ACM
106views Algorithms» more  STOC 2009»
16 years 7 months ago
On proximity oblivious testing
We initiate a systematic study of a special type of property testers. These testers consist of repeating a basic test for a number of times that depends on the proximity parameter...
Oded Goldreich, Dana Ron
KDD
2007
ACM
220views Data Mining» more  KDD 2007»
16 years 7 months ago
SCAN: a structural clustering algorithm for networks
Network clustering (or graph partitioning) is an important task for the discovery of underlying structures in networks. Many algorithms find clusters by maximizing the number of i...
Xiaowei Xu, Nurcan Yuruk, Zhidan Feng, Thomas A. J...
RECOMB
2005
Springer
16 years 6 months ago
Combinatorial Genetic Regulatory Network Analysis Tools for High Throughput Transcriptomic Data
: A series of genome-scale algorithms and high-performance implementations is described and shown to be useful in the genetic analysis of gene transcription. With them it is possib...
Elissa J. Chesler, Michael A. Langston
ESOP
2010
Springer
16 years 3 months ago
Automating Security Mediation Placement
Abstract. We present a framework that automatically produces suggestions to resolve type errors in security-typed programs, enabling legacy code to be retrofit with comprehensive s...
Dave King 0002, Divya Muthukumaran, Sanjit A. Sesh...
CIAC
2010
Springer
376views Algorithms» more  CIAC 2010»
16 years 3 months ago
Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights
In this paper we consider a natural generalization of the well-known Max Leaf Spanning Tree problem. In the generalized Weighted Max Leaf problem we get as input an undirected co...
Bart Jansen