Sciweavers

826 search results - page 52 / 166
» Designing for families
Sort
View
HCI
2007
14 years 11 months ago
Privacy Issues for the Disclosure of Emotions to Remote Acquaintances Without Simultaneous Communication
We discuss the privacy issues related to the design of systems that disclose information about emotions to remote acquaintances, without simultaneous communication: users do not ch...
Sébastien Duval, Christian Becker, Hiromich...
ICFP
2006
ACM
15 years 9 months ago
A pattern for almost compositional functions
This paper introduces a pattern for almost compositional functions over recursive data types, and over families of mutually recursive data types. Here "almost compositional&q...
Aarne Ranta, Björn Bringert
ISCAS
2008
IEEE
129views Hardware» more  ISCAS 2008»
15 years 4 months ago
Physical unclonable function with tristate buffers
— The lack of robust tamper-proofing techniques in security applications has provided attackers the ability to virtually circumvent mathematically strong cryptographic primitive...
Erdinç Öztürk, Ghaith Hammouri, B...
BIBE
2007
IEEE
147views Bioinformatics» more  BIBE 2007»
15 years 4 months ago
A New Alignment-Independent Algorithm for Clustering Protein Sequences
—The rapid burgeoning of available protein data makes the use of clustering within families of proteins increasingly important, the challenge is to identify subfamilies of evolut...
Abdellali Kelil, Shengrui Wang, Ryszard Brzezinski
IPCO
2008
118views Optimization» more  IPCO 2008»
14 years 11 months ago
Constraint Orbital Branching
Orbital branching is a method for branching on variables in integer programming that reduces the likelihood of evaluating redundant, isomorphic nodes in the branch-and-bound proce...
James Ostrowski, Jeff Linderoth, Fabrizio Rossi, S...