Sciweavers

6274 search results - page 113 / 1255
» From query complexity to computational complexity
Sort
View
125
Voted
CRYPTO
2000
Springer
141views Cryptology» more  CRYPTO 2000»
15 years 8 months ago
Improved Non-committing Encryption Schemes Based on a General Complexity Assumption
Abstract. Non-committing encryption enables the construction of multiparty computation protocols secure against an adaptive adversary in the computational setting where private cha...
Ivan Damgård, Jesper Buus Nielsen
150
Voted
RECOMB
2005
Springer
16 years 4 months ago
Decomposition of Overlapping Protein Complexes: A Graph Theoretical Method for Analyzing Static and Dynamic Protein Associations
Background: Most cellular processes are carried out by multi-protein complexes, groups of proteins that bind together to perform a specific task. Some proteins form stable complex...
Elena Zotenko, Katia S. Guimarães, Raja Jot...
TGIS
2008
69views more  TGIS 2008»
15 years 3 months ago
Spatial-Scene Similarity Queries
Assessing spatial scenes for similarity is difficult from a cognitive and computational perspective. Solutions to spatial-scene similarity assessments are sensible only if corresp...
Konstantinos A. Nedas, Max J. Egenhofer
MABS
2005
Springer
15 years 9 months ago
Visual Modeling for Complex Agent-Based Simulation Systems
Currently there is a diversity of tools for agent-based simulation, which can be applied to the understanding of social phenomena. Describing this kind of phenomena with a visual l...
Candelaria Sansores, Juan Pavón, Jorge J. G...
117
Voted
CORR
2010
Springer
147views Education» more  CORR 2010»
15 years 1 months ago
Matching Dependencies with Arbitrary Attribute Values: Semantics, Query Answering and Integrity Constraints
Matching dependencies (MDs) are used to declaratively specify the identification (or matching) of certain attribute values in pairs of database tuples when some similarity conditi...
Jaffer Gardezi, Leopoldo E. Bertossi, Iluju Kiring...