Sciweavers

3134 search results - page 139 / 627
» Computing full disjunctions
Sort
View
ICISC
2009
108views Cryptology» more  ICISC 2009»
15 years 1 months ago
Lightweight Cryptography and RFID: Tackling the Hidden Overheads
Abstract. The field of lightweight cryptography has developed significantly over recent years and many impressive implementation results have been published. However these results ...
Axel Poschmann, Matthew J. B. Robshaw, Frank Vater...
118
Voted
CORR
2010
Springer
124views Education» more  CORR 2010»
15 years 28 days ago
Lattice model refinement of protein structures
To find the best lattice model representation of a given full atom protein structure is a hard computational problem. Several greedy methods have been suggested where results are ...
Martin Mann, Alessandro Dal Palù
246
Voted
CVPR
2003
IEEE
16 years 5 months ago
Shape and Materials by Example: A Photometric Stereo Approach
This paper presents a technique for computing the geometry of objects with general reflectance properties from images. For surfaces with varying material properties, a full segmen...
Aaron Hertzmann, Steven M. Seitz
132
Voted
WWW
2001
ACM
16 years 4 months ago
Using proxy cache relocation to accelerate Web browsing in wireless/mobile communications
Mobile computing is considered of major importance to the computing industry for the forthcoming years due to the progress in the wireless communications area. A proxy-based archi...
Stathes Hadjiefthymiades, Lazaros F. Merakos
125
Voted
CVPR
2010
IEEE
15 years 11 months ago
Scene Classification and Detection with a Quasi-exhausitve Dataset
Scene categorization is a fundamental problem in computer vision. However, scene understanding research has been constrained by the limited scope of currently-used databases which...
Jianxiong Xiao, James Hays, Krista Ehinger, Antoni...