Sciweavers

656 search results - page 20 / 132
» Large-Graph Layout Algorithms at Work: An Experimental Study
Sort
View
MOBIHOC
2004
ACM
15 years 9 months ago
On greedy geographic routing algorithms in sensing-covered networks
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...
Guoliang Xing, Chenyang Lu, Robert Pless, Qingfeng...
IPPS
2008
IEEE
15 years 4 months ago
SNAP, Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale
We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph framework for exploratory study and partitioning of large-scale networks. To illustrate the c...
David A. Bader, Kamesh Madduri
KDD
2009
ACM
159views Data Mining» more  KDD 2009»
15 years 10 months ago
Mining brain region connectivity for alzheimer's disease study via sparse inverse covariance estimation
Effective diagnosis of Alzheimer's disease (AD), the most common type of dementia in elderly patients, is of primary importance in biomedical research. Recent studies have de...
Liang Sun, Rinkal Patel, Jun Liu, Kewei Chen, Tere...
JAIR
2010
90views more  JAIR 2010»
14 years 4 months ago
An Effective Algorithm for and Phase Transitions of the Directed Hamiltonian Cycle Problem
The Hamiltonian cycle problem (HCP) is an important combinatorial problem with applications in many areas. It is among the first problems used for studying intrinsic properties, i...
Gerold Jäger, Weixiong Zhang
ICDE
2011
IEEE
233views Database» more  ICDE 2011»
14 years 1 months ago
Answering approximate string queries on large data sets using external memory
— An approximate string query is to find from a collection of strings those that are similar to a given query string. Answering such queries is important in many applications su...
Alexander Behm, Chen Li, Michael J. Carey