Sciweavers

289 search results - page 38 / 58
» Simple COMA Node Implementations
Sort
View
WWW
2005
ACM
14 years 9 months ago
Using OWL for querying an XML/RDF syntax
Some recent initiatives try to take profit from RDF to make XML documents interoperate at the semantic level. Ontologies are used to establish semantic connections among XML langu...
Jaime Delgado, Rubén Tous
MOBIHOC
2009
ACM
14 years 9 months ago
Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks
Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS can result in...
Mathieu Leconte, Jian Ni, Rayadurgam Srikant
PODS
2007
ACM
196views Database» more  PODS 2007»
14 years 9 months ago
On the complexity of managing probabilistic XML data
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
Pierre Senellart, Serge Abiteboul
EWSN
2008
Springer
14 years 8 months ago
Resilient Coding Algorithms for Sensor Network Data Persistence
Storing and disseminating coded information instead of the original data can bring significant performance improvements to sensor network protocols. Such methods reduce the risk of...
Daniele Munaretto, Jörg Widmer, Michele Rossi...
IPSN
2010
Springer
14 years 3 months ago
Distributed genetic evolution in WSN
Wireless Sensor Actuator Networks (WSANs) extend wireless sensor networks through actuation capability. Designing robust logic for WSANs however is challenging since nodes can aï¬...
Philip Valencia, Peter Lindsay, Raja Jurdak