Sciweavers

1452 search results - page 272 / 291
» Full and Local Information in Distributed Decision Making
Sort
View
WPES
2003
ACM
14 years 24 days ago
Secure and private sequence comparisons
We give an efficient protocol for sequence comparisons of the edit-distance kind, such that neither party reveals anything about their private sequence to the other party (other t...
Mikhail J. Atallah, Florian Kerschbaum, Wenliang D...
WSNA
2003
ACM
14 years 24 days ago
Analysis on the redundancy of wireless sensor networks
Wireless sensor networks consist of a large number of tiny sensors that have only limited energy supply. One of the major challenges in constructing such networks is to maintain l...
Yong Gao, Kui Wu, Fulu Li
ICDT
2010
ACM
205views Database» more  ICDT 2010»
14 years 12 days ago
On the Aggregation Problem for Synthesized Web Services
The paper formulates and investigates the aggregation problem for synthesized mediators of Web services (SWMs). An SWM is a finite-state transducer defined in terms of templates...
Ting Deng, Wenfei Fan, Leonid Libkin, Yinghui Wu
SIGMOD
2010
ACM
250views Database» more  SIGMOD 2010»
14 years 11 days ago
Spreadsheet as a relational database engine
Spreadsheets are among the most commonly used applications for data management and analysis. Perhaps they are even among the most widely used computer applications of all kinds. H...
Jerzy Tyszkiewicz
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
14 years 11 days ago
Finding maximal cliques in massive networks by H*-graph
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey X...