Sciweavers

2702 search results - page 370 / 541
» Message from the Editor
Sort
View
SIGMOD
2004
ACM
165views Database» more  SIGMOD 2004»
16 years 4 months ago
Industrial-Strength Schema Matching
Schema matching identifies elements of two given schemas that correspond to each other. Although there are many algorithms for schema matching, little has been written about build...
Philip A. Bernstein, Sergey Melnik, Michalis Petro...
158
Voted
PERCOM
2007
ACM
16 years 3 months ago
Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility
Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are many real ...
Thrasyvoulos Spyropoulos, Konstantinos Psounis, Ca...
WISEC
2009
ACM
15 years 10 months ago
Securing network access in wireless sensor networks
In wireless sensor networks, it is critical to restrict the network access only to eligible sensor nodes, while messages from outsiders will not be forwarded in the networks. In t...
Kun Sun, An Liu, Roger Xu, Peng Ning, W. Douglas M...
124
Voted
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
15 years 10 months ago
BGP-lens: patterns and anomalies in internet routing updates
The Border Gateway Protocol (BGP) is one of the fundamental computer communication protocols. Monitoring and mining BGP update messages can directly reveal the health and stabilit...
B. Aditya Prakash, Nicholas Valler, David Andersen...
138
Voted
ASIACRYPT
2009
Springer
15 years 10 months ago
Foundations of Non-malleable Hash and One-Way Functions
Non-malleability is an interesting and useful property which ensures that a cryptographic protocol preserves the independence of the underlying values: given for example an encryp...
Alexandra Boldyreva, David Cash, Marc Fischlin, Bo...