Sciweavers

3946 search results - page 206 / 790
» The computational complexity of choice sets
Sort
View
171
Voted
TISSEC
2008
106views more  TISSEC 2008»
15 years 6 months ago
On predictive models and user-drawn graphical passwords
In commonplace text-based password schemes, users typically choose passwords that are easy to recall, exhibit patterns, and are thus vulnerable to brute-force dictionary attacks. ...
Paul C. van Oorschot, Julie Thorpe
169
Voted
SAC
2005
ACM
16 years 6 days ago
A code compression advisory tool for embedded processors
We present a tool which is designed to be used as a code compression advisory system for object code to be run on an embedded processor. All the compression schemes support run-ti...
Sreejith K. Menon, Priti Shankar
JCB
1998
105views more  JCB 1998»
15 years 6 months ago
Constructing and Counting Phylogenetic Invariants
Abstract. The method of invariants is an approach to the problem of reconstructing the phylogenetic tree of a collection of m taxa using nucleotide sequence data. Models for the re...
Steven N. Evans, Xiaowen Zhou
CHI
2011
ACM
14 years 10 months ago
Oops, I did it again: mitigating repeated access control errors on facebook
We performed a study of Facebook users to examine how they coped with limitations of the Facebook privacy settings interface. Students graduating and joining the workforce create ...
Serge Egelman, Andrew Oates, Shriram Krishnamurthi
CVPR
2007
IEEE
16 years 8 months ago
Learning Local Image Descriptors
In this paper we study interest point descriptors for image matching and 3D reconstruction. We examine the building blocks of descriptor algorithms and evaluate numerous combinati...
Simon A. J. Winder, Matthew Brown