Sciweavers

919 search results - page 164 / 184
» Efficient computation of view subsets
Sort
View
ICTAI
2009
IEEE
13 years 5 months ago
A Generalized Cyclic-Clustering Approach for Solving Structured CSPs
We propose a new method for solving structured CSPs which generalizes and improves the Cyclic-Clustering approach [4]. First, the cutset and the tree-decomposition of the constrai...
Cédric Pinto, Cyril Terrioux
TWC
2010
13 years 2 months ago
Mitigating selective forwarding attacks with a channel-aware approach in WMNs
In this paper, we consider a special case of denial of service (DoS) attack in wireless mesh networks (WMNs) known as selective forwarding attack (a.k.a gray hole attacks). With su...
Devu Manikantan Shila, Yu Cheng, Tricha Anjali
TWC
2010
13 years 2 months ago
Optimized opportunistic multicast scheduling (OMS) over wireless cellular networks
Optimized opportunistic multicast scheduling (OMS) is studied for cellular networks, where the problem of efficiently transmitting a common set of fountain-encoded data from a sin...
Tze-Ping Low, Man-On Pun, Yao-Win Peter Hong, C.-C...
BMCBI
2011
12 years 11 months ago
PhyloMap: an algorithm for visualizing relationships of large sequence data sets and its application to the influenza A virus ge
Background: Results of phylogenetic analysis are often visualized as phylogenetic trees. Such a tree can typically only include up to a few hundred sequences. When more than a few...
Jiajie Zhang, Amir Madany Mamlouk, Thomas Martinet...
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 8 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen