Sciweavers

537 search results - page 3 / 108
» Problems from CGCS Luminy, May 2007
Sort
View
CRYPTO
2007
Springer
132views Cryptology» more  CRYPTO 2007»
13 years 12 months ago
How Should We Solve Search Problems Privately?
Abstract. Secure multiparty computation allows a group of distrusting parties to jointly compute a (possibly randomized) function of their inputs. However, it is often the case tha...
Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinre...
RE
2007
Springer
13 years 12 months ago
Improving Performance Requirements Specifications from Field Failure Reports
Customer-reported field failures provide valuable information for the requirements of the next release. Without a systematic approach, the requirements of the next release may not...
Chih-Wei Ho, Laurie Williams, Annie I. Antó...
ECAL
2007
Springer
13 years 12 months ago
From Solitary to Collective Behaviours: Decision Making and Cooperation
In a social scenario, establishing whether a collaboration is required to achieve a certain goal is a complex problem that requires decision making capabilities and coordination am...
Vito Trianni, Christos Ampatzis, Anders Lyhne Chri...
WWW
2007
ACM
14 years 6 months ago
Just the right amount: extracting modules from ontologies
The ability to extract meaningful fragments from an ontology is key for ontology re-use. We propose a definition of a module that guarantees to completely capture the meaning of a...
Bernardo Cuenca Grau, Ian Horrocks, Yevgeny Kazako...
IJCAI
1993
13 years 7 months ago
Using Inferred Disjunctive Constraints To Decompose Constraint Satisfaction Problems
Constraint satisfaction problems involve finding values for problem variables that satisfy constraints on what combinations of values are permitted. They have applications in many...
Eugene C. Freuder, Paul D. Hubbe