Sciweavers

395 search results - page 63 / 79
» Towards a theory of search queries
Sort
View
COLT
1998
Springer
13 years 12 months ago
Self Bounding Learning Algorithms
Most of the work which attempts to give bounds on the generalization error of the hypothesis generated by a learning algorithm is based on methods from the theory of uniform conve...
Yoav Freund
AICOM
2010
92views more  AICOM 2010»
13 years 7 months ago
SOLAR: An automated deduction system for consequence finding
SOLAR (SOL for Advanced Reasoning) is a first-order clausal consequence finding system based on the SOL (Skip Ordered Linear) tableau calculus. The ability to find non-trivial cons...
Hidetomo Nabeshima, Koji Iwanuma, Katsumi Inoue, O...
CIKM
2008
Springer
13 years 9 months ago
A language for manipulating clustered web documents results
We propose a novel conception language for exploring the results retrieved by several internet search services (like search engines) that cluster retrieved documents. The goal is ...
Gloria Bordogna, Alessandro Campi, Giuseppe Psaila...
ICDE
2007
IEEE
155views Database» more  ICDE 2007»
14 years 9 months ago
Collaborative Wrapping: A Turbo Framework for Web Data Extraction
To access data sources on the Web, a crucial step is wrapping, which translates query responses, rendered in textual HTML, back into their relational form. Traditionally, this pro...
Shui-Lung Chuang, Kevin Chen-Chuan Chang, ChengXia...
ICDE
2007
IEEE
146views Database» more  ICDE 2007»
14 years 9 months ago
Conditional Functional Dependencies for Data Cleaning
We propose a class of constraints, referred to as conditional functional dependencies (CFDs), and study their applications in data cleaning. In contrast to traditional functional ...
Philip Bohannon, Wenfei Fan, Floris Geerts, Xibei ...