Sciweavers

206 search results - page 39 / 42
» New Data Structures for Subgraph Connectivity
Sort
View
DATAMINE
2008
95views more  DATAMINE 2008»
14 years 10 months ago
A dynamic bibliometric model for identifying online communities
Predictive modelling of online dynamic user-interaction recordings and community identifi cation from such data b ecomes more and more imp ortant w ith th e w idesp read use of on...
Xin Wang, Ata Kabán
83
Voted
APPROX
2010
Springer
168views Algorithms» more  APPROX 2010»
15 years 1 months ago
Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
Arnab Bhattacharyya, Elena Grigorescu, Madhav Jha,...
103
Voted
MOBIHOC
2008
ACM
15 years 11 months ago
Using persistent homology to recover spatial information from encounter traces
In order to better understand human and animal mobility and its potential effects on Mobile Ad-Hoc networks and Delay-Tolerant Networks, many researchers have conducted experiment...
Brenton D. Walker
BMCBI
2007
176views more  BMCBI 2007»
14 years 11 months ago
Correlation-maximizing surrogate gene space for visual mining of gene expression patterns in developing barley endosperm tissue
Background: Micro- and macroarray technologies help acquire thousands of gene expression patterns covering important biological processes during plant ontogeny. Particularly, fait...
Marc Strickert, Nese Sreenivasulu, Björn Usad...
112
Voted
ALGORITHMICA
2011
14 years 6 months ago
On Bounded Leg Shortest Paths Problems
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...
Liam Roditty, Michael Segal