Sciweavers

2412 search results - page 236 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
SACRYPT
2009
Springer
150views Cryptology» more  SACRYPT 2009»
15 years 10 months ago
Information Theoretically Secure Multi Party Set Intersection Re-visited
We re-visit the problem of secure multiparty set intersection in information theoretic settings. In [16], Li et.al have proposed a protocol for multiparty set intersection problem...
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
BMCBI
2006
120views more  BMCBI 2006»
15 years 3 months ago
Projections for fast protein structure retrieval
Background: In recent times, there has been an exponential rise in the number of protein structures in databases e.g. PDB. So, design of fast algorithms capable of querying such d...
Sourangshu Bhattacharya, Chiranjib Bhattacharyya, ...
JAR
2006
94views more  JAR 2006»
15 years 3 months ago
Answer Set Programming Based on Propositional Satisfiability
Answer Set Programming (ASP) emerged in the late 1990s as a new logic programming paradigm which has been successfully applied in various application domains. Also motivated by the...
Enrico Giunchiglia, Yuliya Lierler, Marco Maratea
TIP
2002
131views more  TIP 2002»
15 years 3 months ago
Optimal edge-based shape detection
Abstract--We propose an approach to accurately detecting twodimensional (2-D) shapes. The cross section of the shape boundary is modeled as a step function. We first derive a one-d...
Hankyu Moon, Rama Chellappa, Azriel Rosenfeld
RECOMB
2005
Springer
16 years 4 months ago
Improved Duplication Models for Proteome Network Evolution
Protein-protein interaction networks, particularly that of the yeast S. Cerevisiae, have recently been studied extensively. These networks seem to satisfy the small world property ...
Gürkan Bebek, Petra Berenbrink, Colin Cooper,...