Sciweavers

68 search results - page 8 / 14
» Axiomatization of an exponential similarity function
Sort
View
ECAI
2008
Springer
13 years 9 months ago
Towards Efficient Belief Update for Planning-Based Web Service Composition
At the "functional level", Semantic Web Services (SWS) are described akin to planning operators, with preconditions and effects relative to an ontology; the ontology prov...
Jörg Hoffmann
CORR
2006
Springer
97views Education» more  CORR 2006»
13 years 7 months ago
The one-way communication complexity of the Boolean Hidden Matching Problem
We give a tight lower bound of ( n) for the randomized one-way communication complexity of the Boolean Hidden Matching Problem [BJK04]. Since there is a quantum one-way communica...
Iordanis Kerenidis, Ran Raz
CORR
2010
Springer
121views Education» more  CORR 2010»
13 years 4 months ago
Universal Rate-Efficient Scalar Quantization
Scalar quantization is the most practical and straightforward approach to signal quantization. However, it has been shown that scalar quantization of oversampled or Compressively ...
Petros Boufounos
CORR
2010
Springer
90views Education» more  CORR 2010»
13 years 4 months ago
Fast Pseudo-Random Fingerprints
Abstract. We propose a method to exponentially speed up computation of various fingerprints, such as the ones used to compute similarity and rarity in massive data sets. Rather the...
Yoram Bachrach, Ely Porat
BMCBI
2006
120views more  BMCBI 2006»
13 years 7 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, ...