Sciweavers

613 search results - page 31 / 123
» The Model-Summary Problem and a Solution for Trees
Sort
View
RFIDSEC
2010
14 years 12 months ago
Tree-Based RFID Authentication Protocols Are Definitively Not Privacy-Friendly
Authentication for low-cost Radio-Frequency IDentification (RFID) is a booming research topic. The challenge is to develop secure protocols using lightweight cryptography, yet ensu...
Gildas Avoine, Benjamin Martin 0002, Tania Martin
MOBIHOC
2002
ACM
16 years 1 months ago
Constructing minimum-energy broadcast trees in wireless ad hoc networks
In this paper we assume that a multihop wireless network (also called a wireless ad hoc network) consists of nodes whose transmitting powers are finitely adjustable. We consider t...
Weifa Liang
ICALP
2005
Springer
15 years 7 months ago
The Generalized Deadlock Resolution Problem
In this paper we initiate the study of the AND-OR directed feedback vertex set problem from the viewpoint of approximation algorithms. This AND-OR feedback vertex set problem is m...
Kamal Jain, Mohammad Taghi Hajiaghayi, Kunal Talwa...
ALGORITHMICA
1999
112views more  ALGORITHMICA 1999»
15 years 1 months ago
Suffix Trees on Words
We discuss an intrinsic generalization of the suffix tree, designed to index a string of length n which has a natural partitioning into m multicharacter substrings or words. This ...
Arne Andersson, N. Jesper Larsson, Kurt Swanson
ICDT
2009
ACM
105views Database» more  ICDT 2009»
16 years 2 months ago
Efficient data structures for range-aggregate queries on trees
Graph-theoretic aggregation problems have been considered both in OLAP (grid graph) and XML (tree). This paper gives new results for MIN aggregation in a tree, where we want the M...
Hao Yuan, Mikhail J. Atallah