Sciweavers

77 search results - page 7 / 16
» Keeping Bits Safe: How Hard Can It Be
Sort
View
ISLPED
2003
ACM
95views Hardware» more  ISLPED 2003»
14 years 26 days ago
Power efficient comparators for long arguments in superscalar processors
Traditional pulldown comparators that are used to implement associativeaddressing logic in superscalar microprocessors dissipate energy on a mismatch in any bit position in the co...
Dmitry Ponomarev, Gurhan Kucuk, Oguz Ergin, Kanad ...
CHI
2011
ACM
12 years 11 months ago
Improving the safety of homeless young people with mobile phones: values, form and function
By their pervasiveness and by being worn on our bodies, mobile phones seem to have become intrinsic to safety. To examine this proposition, 43 participants, from four stakeholder ...
Jill Palzkill Woelfer, Amy Iverson, David G. Hendr...
SSD
2007
Springer
243views Database» more  SSD 2007»
14 years 1 months ago
Continuous Medoid Queries over Moving Objects
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Stavros Papadopoulos, Dimitris Sacharidis, Kyriako...
ICWS
2007
IEEE
13 years 9 months ago
Probabilistic QoS and soft contracts for transaction based Web services
— Web services orchestrations and choreographies require establishing Quality of Service (QoS) contracts with the user. This is achieved by performing QoS composition, based on c...
Sidney Rosario, Albert Benveniste, Stefan Haar, Cl...
STACS
1992
Springer
13 years 11 months ago
Secure Commitment Against A Powerful Adversary
abstract Rafail Ostrovskyy Ramarathnam Venkatesanz Moti Yungx Secure commitment is a primitive enabling information hiding, which is one of the most basic tools in cryptography. S...
Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yun...