Sciweavers

2434 search results - page 19 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
ICASSP
2009
IEEE
14 years 7 months ago
Fast mean square convergence of consensus algorithms in WSNs with random topologies
The average consensus in wireless sensor networks is achieved under assumptions of symmetric or balanced topology at every time instant. However, communication and/or node failure...
Silvana Silva Pereira, Alba Pagès-Zamora
KDD
2006
ACM
160views Data Mining» more  KDD 2006»
15 years 10 months ago
Coherent closed quasi-clique discovery from large dense graph databases
Frequent coherent subgraphscan provide valuable knowledgeabout the underlying internal structure of a graph database, and mining frequently occurring coherent subgraphs from large...
Zhiping Zeng, Jianyong Wang, Lizhu Zhou, George Ka...
ESA
2001
Springer
132views Algorithms» more  ESA 2001»
15 years 2 months ago
Greedy Algorithms for Minimisation Problems in Random Regular Graphs
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...
Michele Zito
JIIS
2008
133views more  JIIS 2008»
14 years 9 months ago
Maintaining frequent closed itemsets over a sliding window
In this paper, we study the incremental update of Frequent Closed Itemsets (FCIs) over a sliding window in a high-speed data stream. We propose the notion of semi-FCIs, which is to...
James Cheng, Yiping Ke, Wilfred Ng
AIRWEB
2007
Springer
15 years 3 months ago
Extracting Link Spam using Biased Random Walks from Spam Seed Sets
Link spam deliberately manipulates hyperlinks between web pages in order to unduly boost the search engine ranking of one or more target pages. Link based ranking algorithms such ...
Baoning Wu, Kumar Chellapilla