Sciweavers

1984 search results - page 261 / 397
» The colourful feasibility problem
Sort
View
TCC
2010
Springer
188views Cryptology» more  TCC 2010»
16 years 1 months ago
Founding Cryptography on Tamper-Proof Hardware Tokens
A number of works have investigated using tamper-proof hardware tokens as tools to achieve a variety of cryptographic tasks. In particular, Goldreich and Ostrovsky considered the ...
Vipul Goyal, Yuval Ishai, Amit Sahai, Ramarathnam ...
ICC
2007
IEEE
143views Communications» more  ICC 2007»
16 years 21 days ago
Impact of Sampling Jitter on Mostly-Digital Architectures for UWB Bio-Medical Applications
Abstract— Ultra-wideband (UWB) impulse radio is a promising technique for low-power bio-medical communication systems. While a range of analog and digital UWB architectures exist...
Andrew Fort, Mike Chen, Robert W. Brodersen, Claud...
EMMCVPR
2007
Springer
16 years 16 days ago
Compositional Object Recognition, Segmentation, and Tracking in Video
Abstract. The complexity of visual representations is substantially limited by the compositional nature of our visual world which, therefore, renders learning structured object mod...
Björn Ommer, Joachim M. Buhmann
GECCO
2005
Springer
138views Optimization» more  GECCO 2005»
15 years 12 months ago
Promising infeasibility and multiple offspring incorporated to differential evolution for constrained optimization
In this paper, we incorporate a diversity mechanism to the differential evolution algorithm to solve constrained optimization problems without using a penalty function. The aim is...
Efrén Mezura-Montes, Jesús Vel&aacut...
STACS
1992
Springer
15 years 10 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...