Sciweavers

328 search results - page 50 / 66
» Simple Termination Revisited
Sort
View
ICCV
2011
IEEE
12 years 7 months ago
In Defense of Soft-assignment Coding
In object recognition, soft-assignment coding enjoys computational efficiency and conceptual simplicity. However, its classification performance is inferior to the newly develop...
Lingqiao Liu, Lei Wang, Xinwang Liu
STOC
2007
ACM
140views Algorithms» more  STOC 2007»
14 years 7 months ago
On the submodularity of influence in social networks
We prove and extend a conjecture of Kempe, Kleinberg, and Tardos (KKT) on the spread of influence in social networks. A social network can be represented by a directed graph where...
Elchanan Mossel, Sébastien Roch
SOUPS
2009
ACM
14 years 2 months ago
Look into my eyes!: can you guess my password?
Authentication systems for public terminals – and thus public spaces – have to be fast, easy and secure. Security is of utmost importance since the public setting allows manif...
Alexander De Luca, Martin Denzel, Heinrich Hussman...
PSSE
2004
Springer
14 years 27 days ago
Developing and Reasoning About Probabilistic Programs in pGCL
“demonic” nondeterminism, representing abstraction from (or ignorance of) which of two program fragments will be executed. By introducing probabilistic nondeterminism into GCL,...
Annabelle McIver, Carroll Morgan
LICS
2002
IEEE
14 years 14 days ago
Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory
This paper provides a unifying axiomatic account of the interpretation of recursive types that incorporates both domain-theoretic and realizability models as concrete instances. O...
Alex K. Simpson