Sciweavers

4137 search results - page 231 / 828
» On the number of matchings of a tree
Sort
View
WEBI
2004
Springer
16 years 5 hour ago
Type-Based Composition of Information Services in Large Scale Environments
Service matchmaking and composition has recently drawn increasing attention in the research community. Most existing algorithms construct chains of services based on exact matches...
Ion Constantinescu, Boi Faltings, Walter Binder
ICWS
2004
IEEE
15 years 8 months ago
Large Scale, Type-Compatible Service Composition
Service matchmaking and composition has recently drawn increasing attention in the research community. Most existing algorithms construct chains of services based on exact matches...
Ion Constantinescu, Boi Faltings, Walter Binder
MONET
2006
103views more  MONET 2006»
15 years 6 months ago
Minimum-Energy Broadcasting in Multi-hop Wireless Networks Using a Single Broadcast Tree
In this paper we address the minimum-energy broadcast problem in multi-hop wireless networks, so that all broadcast requests initiated by different source nodes take place on the s...
Ioannis Papadimitriou, Leonidas Georgiadis
WWW
2001
ACM
16 years 7 months ago
Batch rekeying for secure group communications
Many emerging web and Internet applications are based on a group communications model. Thus, securing group communications is an important Internet design issue. The key graph app...
Xiaozhou (Steve) Li, Yang Richard Yang, Mohamed G....
PIMRC
2008
IEEE
16 years 1 months ago
Dynamic data aggregation and transport in wireless sensor networks
—In wireless sensor networks, in-network aggregation is the process of compressing locally the data gathered by the sensor nodes, so that only the compressed data travel across s...
Mario O. Diaz, Kin K. Leung