Sciweavers

889 search results - page 127 / 178
» A Method for Secure Query Processing in Mobile Databases
Sort
View
SSD
2007
Springer
243views Database» more  SSD 2007»
15 years 3 months ago
Continuous Medoid Queries over Moving Objects
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Stavros Papadopoulos, Dimitris Sacharidis, Kyriako...
85
Voted
ICASSP
2011
IEEE
14 years 1 months ago
Semantic data selection for vertical business voice search
Local business voice search is a popular application for mobile phones, where hands-free interaction and speed are critical to users. However, speech recognition accuracy is still...
Giuseppe Di Fabbrizio, Diamantino Caseiro, Amanda ...
DASFAA
2006
IEEE
92views Database» more  DASFAA 2006»
15 years 1 months ago
Document Decomposition for XML Compression: A Heuristic Approach
Sharing of common subtrees has been reported useful not only for XML compression but also for main-memory XML query processing. This method compresses subtrees only when they exhib...
Byron Choi
BMCBI
2010
183views more  BMCBI 2010»
14 years 10 months ago
SING: Subgraph search In Non-homogeneous Graphs
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...
Raffaele Di Natale, Alfredo Ferro, Rosalba Giugno,...
JIIS
2002
141views more  JIIS 2002»
14 years 9 months ago
Combining Approximation Techniques and Vector Quantization for Adaptable Similarity Search
Adaptable similarity queries based on quadratic form distance functions are widely popular in data mining application domains including multimedia, CAD, molecular biology or medica...
Christian Böhm, Hans-Peter Kriegel, Thomas Se...