Sciweavers

966 search results - page 56 / 194
» Small Alliances in Graphs
Sort
View
ICDM
2009
IEEE
181views Data Mining» more  ICDM 2009»
13 years 6 months ago
Efficient Discovery of Frequent Correlated Subgraph Pairs
The recent proliferation of graph data in a wide spectrum of applications has led to an increasing demand for advanced data analysis techniques. In view of this, many graph mining ...
Yiping Ke, James Cheng, Jeffrey Xu Yu
IICS
2003
Springer
14 years 1 months ago
Where to Start Browsing the Web?
Both human users and crawlers face the problem of finding good start pages to explore some topic. We show how to assist in qualifying pages as start nodes by link-based ranking al...
Dániel Fogaras
CORR
2011
Springer
215views Education» more  CORR 2011»
13 years 14 days ago
Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Quadratic Integer Programming with PSD Objectives
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...
Venkatesan Guruswami, Ali Kemal Sinop
BMCBI
2010
144views more  BMCBI 2010»
13 years 8 months ago
Finding sRNA generative locales from high-throughput sequencing data with NiBLS
Background: Next-generation sequencing technologies allow researchers to obtain millions of sequence reads in a single experiment. One important use of the technology is the seque...
Daniel MacLean, Vincent Moulton, David J. Studholm...
CORR
2010
Springer
117views Education» more  CORR 2010»
13 years 8 months ago
Reductions Between Expansion Problems
The Small-Set Expansion Hypothesis (Raghavendra, Steurer, STOC 2010) is a natural hardness assumption concerning the problem of approximating the edge expansion of small sets in g...
Prasad Raghavendra, David Steurer, Madhur Tulsiani