Sciweavers

694 search results - page 98 / 139
» Open Graphs and Computational Reasoning
Sort
View
COCOON
2003
Springer
14 years 2 months ago
On a Conjecture on Wiener Indices in Combinatorial Chemistry
Drugs and other chemical compounds are often modeled as polygonal shapes, where each vertex represents an atom of the molecule, and covalent bonds between atoms are represented by...
Yih-En Andrew Ban, Sergei Bespamyatnikh, Nabil H. ...
BMCBI
2007
265views more  BMCBI 2007»
13 years 9 months ago
Large scale clustering of protein sequences with FORCE -A layout based heuristic for weighted cluster editing
Background: Detecting groups of functionally related proteins from their amino acid sequence alone has been a long-standing challenge in computational genome research. Several clu...
Tobias Wittkop, Jan Baumbach, Francisco P. Lobo, S...
CGO
2003
IEEE
14 years 22 days ago
Optimal and Efficient Speculation-Based Partial Redundancy Elimination
Existing profile-guided partial redundancy elimination (PRE) methods use speculation to enable the removal of partial redundancies along more frequently executed paths at the expe...
Qiong Cai, Jingling Xue
IPMU
1992
Springer
14 years 1 months ago
Rule-Based Systems with Unreliable Conditions
This paper deals with the problem of inference under uncertain information. This is a generalization of a paper of Cardona et al. (1991a) where rules were not allowed to contain n...
L. Cardona, Jürg Kohlas, Paul-André Mo...
CRYPTO
2007
Springer
132views Cryptology» more  CRYPTO 2007»
14 years 3 months ago
How Should We Solve Search Problems Privately?
Abstract. Secure multiparty computation allows a group of distrusting parties to jointly compute a (possibly randomized) function of their inputs. However, it is often the case tha...
Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinre...