Sciweavers

801 search results - page 71 / 161
» Minimal Locked Trees
Sort
View
CADE
2008
Springer
16 years 6 months ago
Automata-Based Axiom Pinpointing
Axiom pinpointing has been introduced in description logics (DL) to help the user understand the reasons why consequences hold by computing minimal subsets of the knowledge base th...
Franz Baader, Rafael Peñaloza
EDBT
2004
ACM
187views Database» more  EDBT 2004»
16 years 6 months ago
Hierarchical In-Network Data Aggregation with Quality Guarantees
Earlier work has demonstrated the effectiveness of in-network data aggregation in order to minimize the amount of messages exchanged during continuous queries in large sensor netwo...
Antonios Deligiannakis, Yannis Kotidis, Nick Rouss...
WMCSA
1999
IEEE
15 years 10 months ago
An Adaptive Protocol for Reliable Multicast in Mobile Multi-hop Radio Networks
In this paper we propose a new protocol for reliable multicast in a multi-hop mobile radio network. The protocol is reliable, i.e., it guarantees message delivery to all multicast...
Sandeep K. S. Gupta, Pradip K. Srimani
TPDS
2008
136views more  TPDS 2008»
15 years 6 months ago
Data Gathering with Tunable Compression in Sensor Networks
We study the problem of constructing a data gathering tree over a wireless sensor network in order to minimize the total energy for compressing and transporting information from a ...
Yang Yu, Bhaskar Krishnamachari, Viktor K. Prasann...
JCB
1998
105views more  JCB 1998»
15 years 6 months ago
Constructing and Counting Phylogenetic Invariants
Abstract. The method of invariants is an approach to the problem of reconstructing the phylogenetic tree of a collection of m taxa using nucleotide sequence data. Models for the re...
Steven N. Evans, Xiaowen Zhou