Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
337
A Query-by-singing Technique for Retrieving Polyphonic
- Objects of Popular Music,” Proc. Asian Information Retrieval Symposium
"... Abstract. This paper investigates the problem of retrieving popular music by singing. In contrast to the retrieval of MIDI music, which is easy to acquire the main melody by the selection of the symbolic tracks, retrieving polyphonic objects in CD or MP3 format requires to extract the main melody di ..."
Abstract
-
Cited by 5 (3 self)
- Add to MetaCart
by taking into account the characteristic structure of popular song. In addition, to accommodate users ’ unprofessional or personal singing styles, methods are proposed to handle the inaccuracies of tempo, pause, transposition, or off-key, etc., inevitably existing in queries. The proposed system has been
accepted to appear in IEEE TRANSACTIONS ON MULTIMEDIA A Query-by-Singing System for Retrieving Karaoke Music
"... Abstract—This paper investigates the problem of retrieving karaoke music using query-by-singing techniques. Unlike regular CD music, where the stereo sound involves two audio channels that usually sound the same, karaoke music encompasses two distinct channels in each track: one is a mixture of the ..."
Abstract
- Add to MetaCart
Abstract—This paper investigates the problem of retrieving karaoke music using query-by-singing techniques. Unlike regular CD music, where the stereo sound involves two audio channels that usually sound the same, karaoke music encompasses two distinct channels in each track: one is a mixture
Holistic twig joins: optimal XML pattern matching
- in: Proceedings of ACM SIGMOD International Conference on Management of Data, 2002
"... XML employs a tree-structured data model, and, naturally, XML queries specify patterns of selection predicates on multiple elements related by a tree structure. Finding all occurrences of such a twig pattern in an XML database is a core operation for XML query processing. Prior work has typically de ..."
Abstract
-
Cited by 344 (8 self)
- Add to MetaCart
of this approach for matching twig patterns is that intermediate result sizes can get large, even when the input and output sizes are more manageable. In this paper, we propose a novel holistic twig join algorithm, TwigStack, for matching an XML query twig pattern. Our technique uses a chain of linked stacks
Including Group-By in Query Optimization
, 1994
"... In existing relational database systems, processing of group-by and computation of aggregate functions are always postponed until all joins are performed. In this paper, we present transformations that make it possible to push group-by operation past one or more joins and can potentially reduce the ..."
Abstract
-
Cited by 121 (6 self)
- Add to MetaCart
the cost of processing a query significantly. Therefore, the placement of group-by should be decided based on cost estimation. We explain how the traditional System-R style optimizers can be modified by incorporating the greedy conservative heuristic that we developed. We prove that applications of greedy
Congressional samples for approximate answering of group-by queries
- In Proc. of the 2000 ACM SIGMOD Intl. Conf. on Management of Data
, 2000
"... In large data warehousing environments, it is often advantageous to provide fast, approximate answers to complex decision support queries using precomputed summary statistics, such as samples. Decision support queries routinely segment the data into groups and then aggregate the information in each ..."
Abstract
-
Cited by 98 (4 self)
- Add to MetaCart
will be represented in the sample by very few (often zero) tuples. In this paper, we propose a general class of techniques for obtaining fast, highly-accurate answers for group-by queries. These techniques rely on precomputed non-uniform (biased) samples of the data. In particular, we proposecongressional samples
Bottom-up computation of sparse and Iceberg CUBE
- In Proceedings of the 5th ACM international workshop on Data Warehousing and OLAP, DOLAP ’02
, 1999
"... We introduce the Iceberg-CUBE problem as a reformulation of the datacube (CUBE) problem. The Iceberg-CUBE problem is to compute only those group-by partitions with an aggregate value (e.g., count) above some minimum support threshold. The result of Iceberg-CUBE can be used (1) to answer group-by que ..."
Abstract
-
Cited by 187 (4 self)
- Add to MetaCart
-CUBE computation. BUC builds the CUBE bottom-up; i.e., it builds the CUBE by starting from a group-by on a single attribute, then a group-by on a pair of attributes, then a group-by on three attributes, and so on. This is the opposite of all techniques proposed earlier for computing the CUBE, and has an important
All your iFRAMEs point to us
, 2008
"... As the web continues to play an ever increasing role in information exchange, so too is it becoming the prevailing platform for infecting vulnerable hosts. In this paper, we provide a detailed study of the pervasiveness of so-called drive-by downloads on the Internet. Drive-by downloads are caused b ..."
Abstract
-
Cited by 173 (4 self)
- Add to MetaCart
is that approximately 1.3 % of the incoming search queries to Google’s search engine returned at least one URL labeled as malicious in the results page. We also explore several aspects of the drive-by downloads problem. We study the relationship between the user browsing habits and exposure to malware, the different
An Audio Front End for Query-by-Humming Systems
- In Proceedings of International Symposium on Music Information Retrieval
, 2001
"... In this paper, the problem of processing audio signals is addressed in the context of query-by-humming systems. Since singing is naturally used as input, we aim to develop a front end dedicated to the symbolic translation of voice into a sequence of pitch and duration pairs. This operation is crucia ..."
Abstract
-
Cited by 22 (1 self)
- Add to MetaCart
In this paper, the problem of processing audio signals is addressed in the context of query-by-humming systems. Since singing is naturally used as input, we aim to develop a front end dedicated to the symbolic translation of voice into a sequence of pitch and duration pairs. This operation
A Query-By-Example Technique for Retrieving Popular Songs with Similar Melodies
- Proceedings of ISMIR, 2005
"... Retrieving audio material based on audio queries is an important and challenging issue in the research field of content-based access to popular music. As part of this research field, we present a preliminary investigation into retrieving cover versions of songs specified by users. The technique enab ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Retrieving audio material based on audio queries is an important and challenging issue in the research field of content-based access to popular music. As part of this research field, we present a preliminary investigation into retrieving cover versions of songs specified by users. The technique
A Perceptually Motivated Technique to Query-by-Example Using Color Cardinality
, 1999
"... In this paper we present a method for retrieval of color images via query-by-example which takes into consideration human perception regarding the number of colors present in images being compared.. First, we perform HSV-space segmentation to extract regions of perceptually relevant color, to build ..."
Abstract
- Add to MetaCart
In this paper we present a method for retrieval of color images via query-by-example which takes into consideration human perception regarding the number of colors present in images being compared.. First, we perform HSV-space segmentation to extract regions of perceptually relevant color, to build
Results 1 - 10
of
337
