Sciweavers

66 search results - page 12 / 14
» Finding Graph Matchings in Data Streams
Sort
View
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
14 years 10 months ago
Efficient influence maximization in social networks
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
Wei Chen, Yajun Wang, Siyu Yang
MOBICOM
2010
ACM
13 years 10 months ago
Differential forms for target tracking and aggregate queries in distributed networks
Consider mobile targets moving in a plane and their movements being monitored by a network such as a field of sensors. We develop distributed algorithms for in-network tracking an...
Rik Sarkar, Jie Gao
BMCBI
2005
121views more  BMCBI 2005»
13 years 9 months ago
Automated methods of predicting the function of biological sequences using GO and BLAST
Background: With the exponential increase in genomic sequence data there is a need to develop automated approaches to deducing the biological functions of novel sequences with hig...
Craig E. Jones, Ute Baumann, Alfred L. Brown
ICDE
2002
IEEE
163views Database» more  ICDE 2002»
14 years 11 months ago
Keyword Searching and Browsing in Databases using BANKS
With the growth of the Web, there has been a rapid increase in the number of users who need to access online databases without having a detailed knowledge of the schema or of quer...
Gaurav Bhalotia, Arvind Hulgeri, Charuta Nakhe, So...
JCO
2006
126views more  JCO 2006»
13 years 9 months ago
Combinatorics of TCP reordering
We study a combinatorial problem motivated by a receiver-oriented model of TCP traffic from [7], that incorporates information on both arrival times, and the dynamics of packet IDs...
Anders Hansson, Gabriel Istrate, Shiva Prasad Kasi...