Sciweavers

3899 search results - page 252 / 780
» Robust Image Hashing
Sort
View
ICDE
2001
IEEE
128views Database» more  ICDE 2001»
16 years 8 months ago
Counting Twig Matches in a Tree
We describe efficient algorithms for accurately estimating the number of matches of a small node-labeled tree, i.e., a twig, in a large node-labeled tree, using a summary data str...
Zhiyuan Chen, H. V. Jagadish, Flip Korn, Nick Koud...
DAC
2006
ACM
16 years 7 months ago
SAT sweeping with local observability don't-cares
SAT sweeping is a method for simplifying an AND/INVERTER graph (AIG) by systematically merging graph vertices from the inputs towards the outputs using a combination of structural...
Qi Zhu, Nathan Kitchen, Andreas Kuehlmann, Alberto...
ICNP
2006
IEEE
16 years 19 days ago
Vault: A Secure Binding Service
— Binding services are crucial building blocks in networks and networked applications. A binding service (e.g., the Domain Name System (DNS)) maps certain information, namely, bi...
Guor-Huar Lu, Changho Choi, Zhi-Li Zhang
INFOCOM
2006
IEEE
16 years 19 days ago
A Comparative Study of the DNS Design with DHT-Based Alternatives
— The current Domain Name System (DNS) follows a hierarchical tree structure. Several recent efforts proposed to re-implement DNS as a peer-to-peer network with a flat structure...
Vasileios Pappas, Daniel Massey, Andreas Terzis, L...
IPPS
2006
IEEE
16 years 18 days ago
Privacy-aware presence management in instant messaging systems
Information about online presence allows participants of instant messaging (IM) systems to determine whether their prospective communication partners will be able to answer their ...
Karsten Loesing, Markus Dorsch, Martin Grote, Knut...