Sciweavers

57 search results - page 5 / 12
» A new approach to the planted clique problem
Sort
View
MICS
2008
124views more  MICS 2008»
14 years 8 months ago
Community Structures of Networks
We present an approach to studying the community structures of networks by using linear programming (LP). Starting with a network in terms of (a) a collection of nodes and (b) a co...
William Y. C. Chen, Andreas W. M. Dress, Winking Q...
IWPEC
2004
Springer
15 years 3 months ago
A Structural View on Parameterizing Problems: Distance from Triviality
Based on a series of known and new examples, we propose the generalized setting of “distance from triviality” measurement as a reasonable and prospective way of determining use...
Jiong Guo, Falk Hüffner, Rolf Niedermeier
FOCS
1995
IEEE
15 years 1 months ago
Free Bits, PCPs and Non-Approximability - Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
Mihir Bellare, Oded Goldreich, Madhu Sudan
WABI
2007
Springer
15 years 3 months ago
A Graph Clustering Approach to Weak Motif Recognition
The aim of the motif recognition problem is to detect a set of mutually similar subsequences within a collection of biological sequences. The weak motif recognition problem on DNA ...
Christina Boucher, Daniel G. Brown, Paul Church
RECOMB
2005
Springer
15 years 10 months ago
Segmentation Conditional Random Fields (SCRFs): A New Approach for Protein Fold Recognition
Abstract. Protein fold recognition is an important step towards understanding protein three-dimensional structures and their functions. A conditional graphical model, i.e. segmenta...
Yan Liu, Jaime G. Carbonell, Peter Weigele, Vanath...