Sciweavers

2423 search results - page 144 / 485
» AnswerArt - Contextualized Question Answering
Sort
View
CHI
2008
ACM
16 years 6 months ago
Love and authentication
Passwords are ubiquitous, and users and service providers alike rely on them for their security. However, good passwords may sometimes be hard to remember. For years, security pra...
Markus Jakobsson, Erik Stolterman, Susanne Wetzel,...
PKDD
2009
Springer
135views Data Mining» more  PKDD 2009»
16 years 1 months ago
Syntactic Structural Kernels for Natural Language Interfaces to Databases
A core problem in data mining is to retrieve data in a easy and human friendly way. Automatically translating natural language questions into SQL queries would allow for the design...
Alessandra Giordani, Alessandro Moschitti
STOC
2001
ACM
140views Algorithms» more  STOC 2001»
16 years 6 months ago
Compatible sequences and a slow Winkler percolation
Two infinite 0-1 sequences are called compatible when it is possible to cast out 0's from both in such a way that they become complementary to each other. Answering a question...
Péter Gács
ICDCN
2010
Springer
16 years 1 months ago
A Leader-Free Byzantine Consensus Algorithm
The paper considers the consensus problem in a partially synchronous system with Byzantine faults. It turns out that, in the partially synchronous system, all deterministic algorit...
Fatemeh Borran, André Schiper
BIRTHDAY
2009
Springer
16 years 1 months ago
No Syllogisms for the Numerical Syllogistic
The numerical syllogistic is the extension of the traditional syllogistic with numerical quantifiers of the forms at least C and at most C. It is known that, for the traditional s...
Ian Pratt-Hartmann