Sciweavers

2440 search results - page 200 / 488
» Data-Intensive Question Answering
Sort
View
JCT
2006
77views more  JCT 2006»
15 years 6 months ago
There are uncountably many topological types of locally finite trees
Consider two locally finite rooted trees as equivalent if each of them is a topological minor of the other, with an embedding preserving the tree-order. Answering a question of va...
Lilian Matthiesen
ISCI
2007
122views more  ISCI 2007»
15 years 6 months ago
On the strength of hyperclique patterns for text categorization
The use of association patterns for text categorization has attracted great interest and a variety of useful methods have been developed. However, the key characteristics of patte...
Tieyun Qian, Hui Xiong, Yuanzhen Wang, Enhong Chen
IEEEHPCS
2010
15 years 5 months ago
Portfolio-based Parallel SAT solving
Abstract. In this paper, we explore the two well-known principles of diversification and intensification in portfolio-based parallel SAT solving. These dual concepts play an impo...
Lakhdar Sais
INFOCOM
2010
IEEE
15 years 5 months ago
Password Strength: An Empirical Analysis
—It is a well known fact that user-chosen passwords are somewhat predictable: by using tools such as dictionaries or probabilistic models, attackers and password recovery tools c...
Matteo Dell'Amico, Pietro Michiardi, Yves Roudier
CORR
2011
Springer
199views Education» more  CORR 2011»
15 years 1 months ago
From Machine Learning to Machine Reasoning
A plausible definition of "reasoning" could be "algebraically manipulating previously acquired knowledge in order to answer a new question". This definition co...
Léon Bottou