Sciweavers

736 search results - page 15 / 148
» Approximating the Number of Network Motifs
Sort
View
ICDM
2007
IEEE
175views Data Mining» more  ICDM 2007»
14 years 1 months ago
gApprox: Mining Frequent Approximate Patterns from a Massive Network
Recently, there arise a large number of graphs with massive sizes and complex structures in many new applications, such as biological networks, social networks, and the Web, deman...
Chen Chen, Xifeng Yan, Feida Zhu, Jiawei Han
SECON
2007
IEEE
14 years 1 months ago
Approximation Algorithm for Base Station Placement in Wireless Sensor Networks
Base station location has significant impact on network lifetime performance for a sensor network. For a multihop sensor network, this problem is particular challenging as we need ...
Yi Shi, Yiwei Thomas Hou
MOBIHOC
2007
ACM
14 years 7 months ago
Approximation algorithms for longest-lived directional multicast communications in WANETs
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...
Song Guo, Oliver W. W. Yang, Victor C. M. Leung
CORR
2012
Springer
230views Education» more  CORR 2012»
12 years 3 months ago
Fast Triangle Counting through Wedge Sampling
Graphs and networks are used to model interactions in a variety of contexts, and there is a growing need to be able to quickly assess the qualities of a graph in order to understa...
C. Seshadhri, Ali Pinar, Tamara G. Kolda
IPMU
2010
Springer
13 years 11 months ago
Credal Sets Approximation by Lower Probabilities: Application to Credal Networks
Abstract. Credal sets are closed convex sets of probability mass functions. The lower probabilities specified by a credal set for each element of the power set can be used as cons...
Alessandro Antonucci, Fabio Cuzzolin