Sciweavers

1768 search results - page 217 / 354
» Mining Very Large Databases
Sort
View
123
Voted
ICIP
2004
IEEE
16 years 5 months ago
Feature statistical retrieval applied to content-based copy identification
In many image or video retrieval systems, the search of similar objects in the database includes a spatial access method to a multidimensional feature space. This step is generall...
Alexis Joly, Carl Frélicot, Olivier Buisson
221
Voted
ICDT
2009
ACM
173views Database» more  ICDT 2009»
16 years 4 months ago
Containment of conjunctive queries on annotated relations
We study containment and equivalence of (unions of) conjunctive queries on relations annotated with elements of a commutative semiring. Such relations and the semantics of positiv...
Todd J. Green
PODS
2007
ACM
196views Database» more  PODS 2007»
16 years 3 months ago
On the complexity of managing probabilistic XML data
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
Pierre Senellart, Serge Abiteboul
151
Voted
KDD
2008
ACM
140views Data Mining» more  KDD 2008»
16 years 4 months ago
On updates that constrain the features' connections during learning
In many multiclass learning scenarios, the number of classes is relatively large (thousands,...), or the space and time efficiency of the learning system can be crucial. We invest...
Omid Madani, Jian Huang 0002
KDD
2002
ACM
169views Data Mining» more  KDD 2002»
16 years 4 months ago
Optimizing search engines using clickthrough data
This paper presents an approach to automatically optimizing the retrieval quality of search engines using clickthrough data. Intuitively, a good information retrieval system shoul...
Thorsten Joachims