Sciweavers

1117 search results - page 109 / 224
» Equivalent Representations of Set Functions
Sort
View
AIM
2006
14 years 11 months ago
Increasing the benefit of analysis: The case of systems that support communication
: Researchers in academia and practitioners in the field are concluding that object orientation (OO) supports well the stages of technical design and programming but not the stages...
Dov Te'eni, Roy Gelbard, Matti Sade
ARITH
2003
IEEE
15 years 3 months ago
On Computing Addition Related Arithmetic Operations via Controlled Transport of Charge
In this paper we investigate the implementation of basic arithmetic functions, such as addition and multiplication, in Single Electron Tunneling (SET) technology. First, we descri...
Sorin Cotofana, Casper Lageweg, Stamatis Vassiliad...
JOC
2008
86views more  JOC 2008»
14 years 9 months ago
Lower Bounds and Impossibility Results for Concurrent Self Composition
In the setting of concurrent self composition, a single protocol is executed many times concurrently by a single set of parties. In this paper, we prove lower bounds and impossibi...
Yehuda Lindell
BMCBI
2007
115views more  BMCBI 2007»
14 years 9 months ago
Recognizing protein-protein interfaces with empirical potentials and reduced amino acid alphabets
Background: In structural genomics, an important goal is the detection and classification of protein–protein interactions, given the structures of the interacting partners. We h...
Guillaume Launay, Raul Mendez, Shoshana J. Wodak, ...
EDBT
2008
ACM
122views Database» more  EDBT 2008»
15 years 10 months ago
Mining all frequent projection-selection queries from a relational table
In this paper we study the problem of mining all frequent queries in a given database table, a problem known to be intractable even for conjunctive queries. We restrict our attent...
Tao-Yuan Jen, Dominique Laurent, Nicolas Spyratos