Sciweavers

387 search results - page 3 / 78
» Reasoning About Approximate Match Query Results
Sort
View
JASIS
2010
170views more  JASIS 2010»
13 years 3 months ago
Analyzing URL queries
This study investigated a relatively unexamined query type, queries composed of URLs. The extent, variation and user click-through behavior was examined to determine the intent be...
Wei Meng Lee, Mark Sanderson
ILP
1999
Springer
13 years 9 months ago
Approximate ILP Rules by Backpropagation Neural Network: A Result on Thai Character Recognition
This paper presents an application of Inductive Logic Programming (ILP) and Backpropagation Neural Network (BNN) to the problem of Thai character recognition. In such a learning pr...
Boonserm Kijsirikul, Sukree Sinthupinyo
CACM
2010
113views more  CACM 2010»
13 years 5 months ago
Reasoning about the unknown in static analysis
Static program analysis techniques cannot know certain values, such as the value of user input or network state, at analysis time. While such unknown values need to be treated as ...
Isil Dillig, Thomas Dillig, Alex Aiken
CLIMA
2006
13 years 6 months ago
Answer Set Programming for Representing and Reasoning About Virtual Institutions
It is recognised that institutions are potentially powerful means for making agent interactions effective and efficient, but institutions will only really be useful when, as in oth...
Owen Cliffe, Marina De Vos, Julian A. Padget
FQAS
2009
Springer
127views Database» more  FQAS 2009»
13 years 12 months ago
Finding Top-k Approximate Answers to Path Queries
We consider the problem of finding and ranking paths in semistructured data without necessarily knowing its full structure. The query language we adopt comprises conjunctions of r...
Carlos A. Hurtado, Alexandra Poulovassilis, Peter ...