Sciweavers

1238 search results - page 122 / 248
» View-based query containment
Sort
View
IJCAI
2007
15 years 4 months ago
Optimistic Active-Learning Using Mutual Information
An “active learning system” will sequentially decide which unlabeled instance to label, with the goal of efficiently gathering the information necessary to produce a good cla...
Yuhong Guo, Russell Greiner
ECCC
2010
91views more  ECCC 2010»
15 years 3 months ago
Limits on the rate of locally testable affine-invariant codes
A linear code is said to be affine-invariant if the coordinates of the code can be viewed as a vector space and the code is invariant under an affine transformation of the coordin...
Eli Ben-Sasson, Madhu Sudan
TKDE
1998
142views more  TKDE 1998»
15 years 2 months ago
Performance Analysis of Three Text-Join Algorithms
—When a multidatabase system contains textual database systems (i.e., information retrieval systems), queries against the global schema of the multidatabase system may contain a ...
Weiyi Meng, Clement T. Yu, Wei Wang 0010, Naphtali...
TMM
2002
140views more  TMM 2002»
15 years 2 months ago
Narrowing the semantic gap - improved text-based web document retrieval using visual features
In this paper, we present the results of our work that seek to negotiate the gap between low-level features and high-level concepts in the domain of web document retrieval. This wo...
Rong Zhao, William I. Grosky
TALG
2010
110views more  TALG 2010»
15 years 1 months ago
Approximating fractional hypertree width
Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes from the fact that, as shown in previous work [14], ...
Dániel Marx