Sciweavers

7167 search results - page 1274 / 1434
» Answer Set Programming
Sort
View
TWC
2011
291views more  TWC 2011»
13 years 4 months ago
On Optimal Cooperator Selection Policies for Multi-Hop Ad Hoc Networks
Abstract—In this paper we consider wireless cooperative multihop networks, where nodes that have decoded the message at the previous hop cooperate in the transmission toward the ...
Michele Rossi, Cristiano Tapparello, Stefano Tomas...
JMLR
2010
102views more  JMLR 2010»
13 years 4 months ago
Efficient Algorithms for Conditional Independence Inference
The topic of the paper is computer testing of (probabilistic) conditional independence (CI) implications by an algebraic method of structural imsets. The basic idea is to transfor...
Remco R. Bouckaert, Raymond Hemmecke, Silvia Lindn...
SIGKDD
2010
126views more  SIGKDD 2010»
13 years 4 months ago
MultiClust 2010: discovering, summarizing and using multiple clusterings
Traditional clustering focuses on finding a single best clustering solution from data. However, given a single data set, one could interpret it in different ways. This is particul...
Xiaoli Z. Fern, Ian Davidson, Jennifer G. Dy
SJ
2010
136views more  SJ 2010»
13 years 4 months ago
Optimizing the Migration to Future-Generation Passive Optical Networks (PON)
We study the upgrading problem of existing Passive Optical Networks (PONs) that need to increase their capacity at different points in time. Our method upgrades line rates and migr...
M. De Andrade, Massimo Tornatore, S. Sallent, Bisw...
TCBB
2010
98views more  TCBB 2010»
13 years 4 months ago
VARUN: Discovering Extensible Motifs under Saturation Constraints
Abstract-The discovery of motifs in biosequences is frequently torn between the rigidity of the model on the one hand and the abundance of candidates on the other. In particular, m...
Alberto Apostolico, Matteo Comin, Laxmi Parida
« Prev « First page 1274 / 1434 Last » Next »