Sciweavers

970 search results - page 165 / 194
» On encodings of spanning trees
Sort
View
FORTE
2011
13 years 2 months ago
A Framework for Verifying Data-Centric Protocols
Abstract. Data centric languages, such as recursive rule based languages, have been proposed to program distributed applications over networks. They simplify greatly the code, whic...
Yuxin Deng, Stéphane Grumbach, Jean-Fran&cc...
INFOCOM
2011
IEEE
13 years 2 months ago
Forwarding anomalies in Bloom filter-based multicast
Abstract—Several recently proposed multicast protocols use inpacket Bloom filters to encode multicast trees. These mechanisms are in principle highly scalable because no per-fl...
Mikko Särelä, Christian Esteve Rothenber...
BPM
2006
Springer
166views Business» more  BPM 2006»
14 years 2 months ago
Process Mining by Measuring Process Block Similarity
Mining, discovering, and integrating process-oriented services has attracted growing attention in the recent year. Workflow precedence graph and workflow block structures are two i...
Joonsoo Bae, James Caverlee, Ling Liu, Hua Yan
BMCBI
2006
161views more  BMCBI 2006»
13 years 11 months ago
A method for rapid similarity analysis of RNA secondary structures
Background: Owing to the rapid expansion of RNA structure databases in recent years, efficient methods for structure comparison are in demand for function prediction and evolution...
Na Liu, Tianming Wang
ML
2011
ACM
308views Machine Learning» more  ML 2011»
13 years 5 months ago
Relational information gain
Abstract. Type Extension Trees (TET) have been recently introduced as an expressive representation language allowing to encode complex combinatorial features of relational entities...
Marco Lippi, Manfred Jaeger, Paolo Frasconi, Andre...