Sciweavers

1688 search results - page 177 / 338
» The Complexity of Rationalizing Matchings
Sort
View
IACR
2011
127views more  IACR 2011»
14 years 5 months ago
Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
Secure multiparty computation (MPC) allows a set of n players to compute any public function, given as an arithmetic circuit, on private inputs, so that privacy of the inputs as we...
Eli Ben-Sasson, Serge Fehr, Rafail Ostrovsky
RECOMB
2006
Springer
16 years 6 months ago
Assessing Significance of Connectivity and Conservation in Protein Interaction Networks
Computational and comparative analysis of protein-protein interaction (PPI) networks enable understanding of the modular organization of the cell through identification of functio...
Mehmet Koyutürk, Ananth Grama, Wojciech Szpan...
BTW
2009
Springer
138views Database» more  BTW 2009»
16 years 19 days ago
GEM: A Generic Visualization and Editing Facility for Heterogeneous Metadata
: Many model management tasks, e.g., schema matching or merging, require the manual handling of metadata. Given the diversity of metadata, its many different representations and mo...
Jürgen Göres, Thomas Jörg, Boris St...
HPDC
2008
IEEE
16 years 15 days ago
Ontological framework for a free-form query based grid search engine
If the model of free-form queries, which has proved successful for HTML based search on the Web, is made available for Grid services, it will serve as a powerful tool for scientis...
Chaitali Gupta, Rajdeep Bhowmik, Madhusudhan Govin...
AUIC
2006
IEEE
16 years 3 days ago
Patternprogrammer: yet another rule-based programming environment for children
Graphical rewrite rules are often used in programming environments for children. These rules consist of two parts: a left-hand side, which is visually matched in the environment, ...
Tim Wright