Sciweavers

1282 search results - page 106 / 257
» Algorithms for Large, Sparse Network Alignment Problems
Sort
View
ICCCN
2008
IEEE
15 years 8 months ago
p-Percent Coverage Schedule in Wireless Sensor Networks
—We investigate the p-percent coverage problem in this paper and propose two algorithms to prolong network lifetime based on the fact that for some applications full coverage is ...
Shan Gao, Xiaoming Wang, Yingshu Li
ICDM
2009
IEEE
125views Data Mining» more  ICDM 2009»
15 years 9 months ago
A Fully Automated Method for Discovering Community Structures in High Dimensional Data
—Identifying modules, or natural communities, in large complex networks is fundamental in many fields, including social sciences, biological sciences and engineering. Recently s...
Jianhua Ruan
141
Voted
IWANN
2009
Springer
15 years 9 months ago
Identifying Gene Ontology Areas for Automated Enrichment
Biomedical ontologies provide a commonly accepted scheme for the characterization of biological concepts that enable knowledge sharing and integration. Updating and maintaining an ...
Catia Pesquita, Tiago Grego, Francisco M. Couto
SSD
2005
Springer
188views Database» more  SSD 2005»
15 years 7 months ago
Capacity Constrained Routing Algorithms for Evacuation Planning: A Summary of Results
Abstract. Evacuation planning is critical for numerous important applications, e.g. disaster emergency management and homeland defense preparation. Efficient tools are needed to pr...
Qingsong Lu, Betsy George, Shashi Shekhar
136
Voted
ISAAC
2010
Springer
226views Algorithms» more  ISAAC 2010»
15 years 8 days ago
On Tractable Cases of Target Set Selection
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
André Nichterlein, Rolf Niedermeier, Johann...