Sciweavers

499 search results - page 42 / 100
» A Search Algorithm for Clusters in a Network or Graph
Sort
View
SBP
2011
Springer
13 years 2 months ago
Ranking Information in Networks
Given a network, we are interested in ranking sets of nodes that score highest on user-specified criteria. For instance in graphs from bibliographic data (e.g. PubMed), we would l...
Tina Eliassi-Rad, Keith Henderson
GLOBECOM
2008
IEEE
14 years 2 months ago
Multi-Cluster Multi-Parent Wake-Up Scheduling in Delay-Sensitive Wireless Sensor Networks
—Immediate notification of urgent but rare events and delivery of time sensitive actuation commands appear in many practical wireless sensor and actuator network applications. M...
Huang Lee, Abtin Keshavarzian, Hamid K. Aghajan
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
14 years 8 months ago
Searching dynamic point sets in spaces with bounded doubling dimension
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
Richard Cole, Lee-Ad Gottlieb
SIGIR
2002
ACM
13 years 7 months ago
Generic summarization and keyphrase extraction using mutual reinforcement principle and sentence clustering
A novel method for simultaneous keyphrase extraction and generic text summarization is proposed by modeling text documents as weighted undirected and weighted bipartite graphs. Sp...
Hongyuan Zha
AAIM
2008
Springer
142views Algorithms» more  AAIM 2008»
13 years 9 months ago
Engineering Label-Constrained Shortest-Path Algorithms
We consider a generalization of the shortest-path problem: given an alphabet , a graph G whose edges are weighted and -labeled, and a regular language L , the L-constrained shortes...
Christopher L. Barrett, Keith R. Bisset, Martin Ho...