Sciweavers

181 search results - page 12 / 37
» Effective characterizations of tree logics
Sort
View
ICDM
2006
IEEE
137views Data Mining» more  ICDM 2006»
14 years 1 months ago
Automatic Construction of N-ary Tree Based Taxonomies
Hierarchies are an intuitive and effective organization paradigm for data. Of late there has been considerable research on automatically learning hierarchical organizations of dat...
Kunal Punera, Suju Rajan, Joydeep Ghosh
EJWCN
2010
115views more  EJWCN 2010»
13 years 2 months ago
Efficient Certification Path Discovery for MANET
A Mobile Ad Hoc Network (MANET) is characterized by the lack of any infrastructure, absence of any kind of centralized administration, frequent mobility of nodes, network partitio...
Georgios Kambourakis, Elisavet Konstantinou, Anast...
BNCOD
2009
145views Database» more  BNCOD 2009»
13 years 8 months ago
A Study of a Positive Fragment of Path Queries: Expressiveness, Normal Form, and Minimization
We study the expressiveness of a positive fragment of path queries, denoted Path+ , on node-labeled trees documents. The expressiveness of Path+ is studied from two angles. First, ...
Yuqing Wu, Dirk Van Gucht, Marc Gyssens, Jan Pared...
DATESO
2004
100views Database» more  DATESO 2004»
13 years 9 months ago
Storage and Retrieval of First Order Logic Terms in a Database
In this paper we present a storage method for sets of first order logic terms in a relational database using function symbols based indexing method of Discrimination trees. This is...
Peter Gurský
ITC
2003
IEEE
167views Hardware» more  ITC 2003»
14 years 23 days ago
Path Delay Test Generation for Domino Logic Circuits in the Presence of Crosstalk
A technique to derive test vectors that exercise the worstcase delay effects in a domino circuit in the presence of crosstalk is described. A model for characterizing the delay of...
Rahul Kundu, R. D. (Shawn) Blanton