Sciweavers

102291 search results - page 19904 / 20459
» Computing
Sort
View
140
Voted
COCO
2006
Springer
93views Algorithms» more  COCO 2006»
15 years 8 months ago
Making Hard Problems Harder
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
Joshua Buresh-Oppenheim, Rahul Santhanam
153
Voted
COCO
2006
Springer
118views Algorithms» more  COCO 2006»
15 years 8 months ago
Learning Monotone Decision Trees in Polynomial Time
We give an algorithm that learns any monotone Boolean function f : {-1, 1}n {-1, 1} to any constant accuracy, under the uniform distribution, in time polynomial in n and in the de...
Ryan O'Donnell, Rocco A. Servedio
146
Voted
FCCM
2004
IEEE
118views VLSI» more  FCCM 2004»
15 years 8 months ago
Virtual Memory Window for a Portable Reconfigurable Cryptography Coprocessor
Reconfigurable System-on-Chip (SoC) platforms that incorporate hard-core processors surrounded by large amounts of FPGA are today commodities: the reconfigurable logic is often us...
Miljan Vuletic, Laura Pozzi, Paolo Ienne
FCCM
2004
IEEE
152views VLSI» more  FCCM 2004»
15 years 8 months ago
Implementing and Evaluating Stream Applications on the Dynamically Reconfigurable Processor
Dynamically Reconfigurable Processor (DRP)[1] developed by NEC Electronics is a coarse grain reconfigurable processor that selects a data path from the on-chip repository of sixte...
Noriaki Suzuki, Shunsuke Kurotaki, Masayasu Suzuki...
FGR
2004
IEEE
170views Biometrics» more  FGR 2004»
15 years 8 months ago
3D Shape Constraint for Facial Feature Localization Using Probabilistic-like Output
This paper presents a method to automatically locate facial feature points under large variations in pose, illumination and facial expressions. First we propose a method to calcul...
Longbin Chen, Lei Zhang, HongJiang Zhang, Mohamed ...
« Prev « First page 19904 / 20459 Last » Next »