Sciweavers

2531 search results - page 141 / 507
» Group testing in graphs
Sort
View
BIBM
2008
IEEE
159views Bioinformatics» more  BIBM 2008»
15 years 11 months ago
Probe Design for Compressive Sensing DNA Microarrays
Abstract—Compressive Sensing Microarrays (CSM) are DNAbased sensors that operate using group testing and compressive sensing (CS) principles. In contrast to conventional DNA micr...
Wei Dai, Olgica Milenkovic, Mona A. Sheikh, Richar...
WAW
2009
Springer
136views Algorithms» more  WAW 2009»
15 years 11 months ago
Permuting Web Graphs
Since the first investigations on web graph compression, it has been clear that the ordering of the nodes of the graph has a fundamental influence on the compression rate (usuall...
Paolo Boldi, Massimo Santini, Sebastiano Vigna
GD
2004
Springer
15 years 10 months ago
Drawing Power Law Graphs
It has been noted that many realistic graphs have a power law degree distribution and exhibit the small world phenomenon. We present drawing methods influenced by recent developm...
Reid Andersen, Fan R. K. Chung, Lincoln Lu
149
Voted
CORR
2008
Springer
131views Education» more  CORR 2008»
15 years 5 months ago
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs
We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolati...
Samir Datta, Raghav Kulkarni, Sambuddha Roy
SIGMOD
2012
ACM
276views Database» more  SIGMOD 2012»
13 years 7 months ago
SCARAB: scaling reachability computation on large graphs
Most of the existing reachability indices perform well on small- to medium- size graphs, but reach a scalability bottleneck around one million vertices/edges. As graphs become inc...
Ruoming Jin, Ning Ruan, Saikat Dey, Jeffrey Xu Yu