Sciweavers

1051 search results - page 205 / 211
» On the Correspondence between Approximations and Similarity
Sort
View
167
Voted
RECOMB
2005
Springer
16 years 6 months ago
Recognition of Binding Patterns Common to a Set of Protein Structures
We present a novel computational method, MultiBind, for recognition of binding patterns common to a set of protein structures. It is the first method which performs a multiple alig...
Maxim Shatsky, Alexandra Shulman-Peleg, Ruth Nussi...
VLDB
2008
ACM
147views Database» more  VLDB 2008»
16 years 6 months ago
Tree-based partition querying: a methodology for computing medoids in large spatial datasets
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
Kyriakos Mouratidis, Dimitris Papadias, Spiros Pap...
SAC
2010
ACM
16 years 28 days ago
Adaptive fuzzy-valued service selection
Service composition concerns both integration of heterogeneous distributed applications and dynamic selection of services. QoS-aware selection enables a service requester with cer...
Davide Bacciu, Maria Grazia Buscemi, Lusine Mkrtch...
ICDCN
2009
Springer
16 years 26 days ago
Byzantine-Resilient Convergence in Oblivious Robot Networks
Given a set of robots with arbitrary initial location and no agreement on a global coordinate system, convergence requires that all robots asymptotically approach the exact same, ...
Zohir Bouzid, Maria Gradinariu Potop-Butucaru, S&e...
FOCS
2009
IEEE
16 years 25 days ago
Agnostic Learning of Monomials by Halfspaces Is Hard
— We prove the following strong hardness result for learning: Given a distribution on labeled examples from the hypercube such that there exists a monomial (or conjunction) consi...
Vitaly Feldman, Venkatesan Guruswami, Prasad Ragha...