Sciweavers

148 search results - page 27 / 30
» Query Evaluation via Tree-Decompositions
Sort
View
DNIS
2010
Springer
250views Database» more  DNIS 2010»
14 years 2 months ago
Towards K-Nearest Neighbor Search in Time-Dependent Spatial Network Databases
The class of k Nearest Neighbor (kNN) queries in spatial networks is extensively studied in the context of numerous applications. In this paper, for the first time we study a gene...
Ugur Demiryurek, Farnoush Banaei Kashani, Cyrus Sh...
BTW
2007
Springer
185views Database» more  BTW 2007»
14 years 1 months ago
Data Staging for OLAP- and OLTP-Applications on RFID Data
: The emerging trend towards seamless monitoring of all business processes via comprehensive sensor networks – in particular RFID readers – creates new data management challeng...
Stefan Krompass, Stefan Aulbach, Alfons Kemper
ISMIR
2005
Springer
179views Music» more  ISMIR 2005»
14 years 26 days ago
Discovering and Visualizing Prototypical Artists by Web-Based Co-Occurrence Analysis
Detecting artists that can be considered as prototypes for particular genres or styles of music is an interesting task. In this paper, we present an approach that ranks artists ac...
Markus Schedl, Peter Knees, Gerhard Widmer
DEXA
2010
Springer
213views Database» more  DEXA 2010»
13 years 8 months ago
Efficient K-Nearest Neighbor Search in Time-Dependent Spatial Networks
The class of k Nearest Neighbor (kNN) queries in spatial networks has been widely studied in the literature. All existing approaches for kNN search in spatial networks assume that ...
Ugur Demiryurek, Farnoush Banaei Kashani, Cyrus Sh...
SIGIR
2010
ACM
13 years 11 months ago
Self-taught hashing for fast similarity search
The ability of fast similarity search at large scale is of great importance to many Information Retrieval (IR) applications. A promising way to accelerate similarity search is sem...
Dell Zhang, Jun Wang, Deng Cai, Jinsong Lu