Sciweavers

2031 search results - page 324 / 407
» On Tree-Constrained Matchings and Generalizations
Sort
View
SIGMOD
2004
ACM
184views Database» more  SIGMOD 2004»
14 years 10 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...
SIGMOD
2003
ACM
152views Database» more  SIGMOD 2003»
14 years 10 months ago
Warping Indexes with Envelope Transforms for Query by Humming
A Query by Humming system allows the user to find a song by humming part of the tune. No musical training is needed. Previous query by humming systems have not provided satisfacto...
Yunyue Zhu, Dennis Shasha
SIGMOD
2002
ACM
165views Database» more  SIGMOD 2002»
14 years 10 months ago
APEX: an adaptive path index for XML data
The emergence of the Web has increased interests in XML data. XML query languages such as XQuery and XPath use label paths to traverse the irregularly structured data. Without a s...
Chin-Wan Chung, Jun-Ki Min, Kyuseok Shim
PODS
2005
ACM
129views Database» more  PODS 2005»
14 years 10 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
ICFP
2007
ACM
14 years 10 months ago
Adding delimited and composable control to a production programming environment
Operators for delimiting control and for capturing composable continuations litter the landscape of theoretical programming language research. Numerous papers explain their advant...
Matthew Flatt, Gang Yu, Robert Bruce Findler, Matt...