Sciweavers

2492 search results - page 101 / 499
» On the General Signature Trees
Sort
View
CORR
2008
Springer
108views Education» more  CORR 2008»
15 years 5 months ago
Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning
Resolution refinements called w-resolution trees with lemmas (WRTL) and with input lemmas (WRTI) are introduced. Dag-like resolution is equivalent to both WRTL and WRTI when there...
Samuel R. Buss, Jan Hoffmann 0002, Jan Johannsen
CIKM
2005
Springer
15 years 11 months ago
Localized routing trees for query processing in sensor networks
In this paper, we propose a novel energy-efficient approach, a localized routing tree (LRT) coupled with a route redirection (RR) strategy, to support various types of queries. LR...
Jie Lian, Lei Chen 0002, Kshirasagar Naik, M. Tame...
137
Voted
ACISICIS
2005
IEEE
15 years 7 months ago
Equivalence of Transforming Non-Linear DACG to Linear Concept Tree
This paper introduces a strategy and its theory proof to transform non-linear concept graph: Directed Acyclic Concept Graph (DACG) into a linear concept tree. The transformation i...
Wenyi Bi, Junping Sun
WWW
2006
ACM
16 years 6 months ago
Tables and trees don't mix (very well)
There are principal differences between the relational model and XML's tree model. This causes problems in all cases where information from these two worlds has to be brought...
Erik Wilde
ICCSA
2007
Springer
15 years 11 months ago
Tracing Illegal Users of Video: Reconsideration of Tree-Specific and Endbuyer-Specific Methods
In our recent study, we have presented an approach for tracing illegal users in content distribution networks using watermarking and fingerprinting techniques [1][2]. In this paper...
Hyun-Ho Kang, Brian M. Kurkoski, Kazuhiko Yamaguch...