Sciweavers

690 search results - page 110 / 138
» Multi-Agent Only Knowing
Sort
View
STOC
2004
ACM
153views Algorithms» more  STOC 2004»
14 years 9 months ago
Bounded-concurrent secure multi-party computation with a dishonest majority
We show how to securely realize any multi-party functionality in a way that preserves security under an a-priori bounded number of concurrent executions, regardless of the number ...
Rafael Pass
SIGMOD
2004
ACM
165views Database» more  SIGMOD 2004»
14 years 9 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...
ICSE
2007
IEEE-ACM
14 years 9 months ago
A Future for Software Engineering?
This paper suggests the need for a software engineering research community conversation about the future that the community would like to have. The paper observes that the researc...
Leon J. Osterweil
SODA
2010
ACM
169views Algorithms» more  SODA 2010»
14 years 6 months ago
Efficiently Decodable Non-adaptive Group Testing
We consider the following "efficiently decodable" nonadaptive group testing problem. There is an unknown string x {0, 1}n with at most d ones in it. We are allowed to t...
Piotr Indyk, Hung Q. Ngo, Atri Rudra
WWW
2010
ACM
14 years 3 months ago
The paths more taken: matching DOM trees to search logs for accurate webpage clustering
An unsupervised clustering of the webpages on a website is a primary requirement for most wrapper induction and automated data extraction methods. Since page content can vary dras...
Deepayan Chakrabarti, Rupesh R. Mehta