Sciweavers

906 search results - page 160 / 182
» Matching Subsequences in Trees
Sort
View
STOC
2001
ACM
134views Algorithms» more  STOC 2001»
14 years 8 months ago
Fully-dynamic min-cut
We show that we can maintain up to polylogarithmic edge connectivity for a fully-dynamic graph in ~O(pn) time per edge insertion or deletion. Within logarithmic factors, this matc...
Mikkel Thorup
27
Voted
SIGMOD
2004
ACM
184views Database» more  SIGMOD 2004»
14 years 7 months ago
Identifying Similarities, Periodicities and Bursts for Online Search Queries
We present several methods for mining knowledge from the query logs of the MSN search engine. Using the query logs, we build a time series for each query word or phrase (e.g., `Th...
Michail Vlachos, Christopher Meek, Zografoula Vage...
PODS
2005
ACM
129views Database» more  PODS 2005»
14 years 7 months ago
Regular rewriting of active XML and unambiguity
We consider here the exchange of Active XML (AXML) data, i.e., XML documents where some of the data is given explicitly while other parts are given only intensionally as calls to ...
Serge Abiteboul, Tova Milo, Omar Benjelloun
EDBT
2008
ACM
120views Database» more  EDBT 2008»
14 years 7 months ago
Schema mapping verification: the spicy way
Schema mapping algorithms rely on value correspondences ? i.e., correspondences among semantically related attributes ? to produce complex transformations among data sources. Thes...
Angela Bonifati, Giansalvatore Mecca, Alessandro P...
ECIR
2009
Springer
14 years 4 months ago
Exploiting Visual Concepts to Improve Text-Based Image Retrieval
In this paper, we study how to automatically exploit visual concepts in a text-based image retrieval task. First, we use Forest of Fuzzy Decision Trees (FFDTs) to automatically ann...
Sabrina Tollari, Marcin Detyniecki, Christophe Mar...