Results 291 to 300 of about 680,970 (356)
Some of the next articles are maybe not open access.
Proceedings of the 18th ACM conference on Information and knowledge management, 2009
We describe methods to search with a query by example in a known domain for information in an unknown domain by exploiting Web search engines. Relational search is an effective way to obtain information in an unknown field for users. For example, if an Apple user searches for Microsoft products, similar Apple products are important clues for the search.
Makoto P. Kato +3 more
openaire +1 more source
We describe methods to search with a query by example in a known domain for information in an unknown domain by exploiting Web search engines. Relational search is an effective way to obtain information in an unknown field for users. For example, if an Apple user searches for Microsoft products, similar Apple products are important clues for the search.
Makoto P. Kato +3 more
openaire +1 more source
Proceedings of the sixth ACM international conference on Multimedia - MULTIMEDIA '98, 1998
This paper considers some of the problems we found trying to extract meaning from images in database applications, and proposes some ways to solve them. We argue that the meaning of an image is an ill-defined entity, and it is not in general possible to derive from an image the meaning that the user of the database wants.
S. Santini, R. Jain
openaire +1 more source
This paper considers some of the problems we found trying to extract meaning from images in database applications, and proposes some ways to solve them. We argue that the meaning of an image is an ill-defined entity, and it is not in general possible to derive from an image the meaning that the user of the database wants.
S. Santini, R. Jain
openaire +1 more source
Proceedings of the 16th International Conference on Extending Database Technology, 2013
With the ever increasing quantities of electronic data, there is a growing need to make sense out of the data. Many advanced database applications are beginning to support this need by integrating domain knowledge encoded as ontologies into queries over relational data.
Lipyeow Lim, Haixun Wang, Min Wang
openaire +1 more source
With the ever increasing quantities of electronic data, there is a growing need to make sense out of the data. Many advanced database applications are beginning to support this need by integrating domain knowledge encoded as ontologies into queries over relational data.
Lipyeow Lim, Haixun Wang, Min Wang
openaire +1 more source
International Journal of Computational Intelligence and Applications, 2002
XML's tree structure provides a rich background for complicated structural searches. In this paper we present a new system, called XML Query by Example (XML QBE) that allows the user to query XML documents exploiting their inherent tree structure. We present some interesting queries and describe the underlying query processing algorithms.
SEN ZHANG +2 more
openaire +1 more source
XML's tree structure provides a rich background for complicated structural searches. In this paper we present a new system, called XML Query by Example (XML QBE) that allows the user to query XML documents exploiting their inherent tree structure. We present some interesting queries and describe the underlying query processing algorithms.
SEN ZHANG +2 more
openaire +1 more source
An acoustic segment modeling approach to query-by-example spoken term detection
IEEE International Conference on Acoustics, Speech, and Signal Processing, 2012The framework of posteriorgram-based template matching has been shown to be successful for query-by-example spoken term detection (STD). This framework employs a tokenizer to convert query examples and test utterances into frame-level posteriorgrams, and
Haipeng Wang +4 more
semanticscholar +1 more source
Query-by-example spoken term detection using phonetic posteriorgram templates
2009 IEEE Workshop on Automatic Speech Recognition & Understanding, 2009This paper examines a query-by-example approach to spoken term detection in audio files. The approach is designed for low-resource situations in which limited or no in-domain training material is available and accurate word-based speech recognition ...
Timothy J. Hazen +2 more
semanticscholar +1 more source
Query-by-example surgical activity detection
International Journal of Computer Assisted Radiology and Surgery, 2016Easy acquisition of surgical data opens many opportunities to automate skill evaluation and teaching. Current technology to search tool motion data for surgical activity segments of interest is limited by the need for manual pre-processing, which can be prohibitive at scale.
Yixin Gao +5 more
openaire +2 more sources
1998
Data Query Languages were developed in the early seventies when the man-machine interface was, by today’s standards, limited and rudimentary. In particular, interaction with the computer was through the processing of batched jobs, where jobs (computation requests such as “run this program on that data”, “evaluate this database query”, etc) were ...
Hermann Maurer +3 more
openaire +1 more source
Data Query Languages were developed in the early seventies when the man-machine interface was, by today’s standards, limited and rudimentary. In particular, interaction with the computer was through the processing of batched jobs, where jobs (computation requests such as “run this program on that data”, “evaluate this database query”, etc) were ...
Hermann Maurer +3 more
openaire +1 more source
2006
A solution to the problem of image retrieval based on query-by-semantic-example (QBSE) is presented. QBSE extends the idea of query-by-example to the domain of semantic image representations. A semantic vocabulary is first defined, and a semantic retrieval system is trained to label each image with the posterior probability of appearance of each ...
Nikhil Rasiwasia +2 more
openaire +1 more source
A solution to the problem of image retrieval based on query-by-semantic-example (QBSE) is presented. QBSE extends the idea of query-by-example to the domain of semantic image representations. A semantic vocabulary is first defined, and a semantic retrieval system is trained to label each image with the posterior probability of appearance of each ...
Nikhil Rasiwasia +2 more
openaire +1 more source
Fast polygon mesh querying by example
ACM SIGGRAPH 99 Conference abstracts and applications, 1999The reusability of three-dimensional models has lead to a proliferation in the number and size of 3D object repositories. These typically store objects in the some polygon mesh file format and allow selection by means of categories and keywords. While keyword searches are useful in many circumstances, they suffer from the subjectivity, ambiguity and ...
James Gain, James Scott
openaire +1 more source