Sciweavers

611 search results - page 65 / 123
» Querying Tree-Structured Data Using Dimension Graphs
Sort
View
AAAI
2012
13 years 4 months ago
Double-Bit Quantization for Hashing
Hashing, which tries to learn similarity-preserving binary codes for data representation, has been widely used for efficient nearest neighbor search in massive databases due to i...
Weihao Kong, Wu-Jun Li
KDID
2003
119views Database» more  KDID 2003»
15 years 3 months ago
Generalized Version Space Trees
We introduce generalized version space trees, a novel data structure that serves as a condensed representation in inductive databases for graph mining. Generalized version space tr...
Ulrich Rückert, Stefan Kramer
WSDM
2009
ACM
114views Data Mining» more  WSDM 2009»
15 years 9 months ago
Wikipedia pages as entry points for book search
A lot of the world’s knowledge is stored in books, which, as a result of recent mass-digitisation efforts, are increasingly available online. Search engines, such as Google Book...
Marijn Koolen, Gabriella Kazai, Nick Craswell
ICDE
2010
IEEE
249views Database» more  ICDE 2010»
15 years 9 months ago
PARINET: A tunable access method for in-network trajectories
— In this paper we propose PARINET, a new access method to efficiently retrieve the trajectories of objects moving in networks. The structure of PARINET is based on a combination...
Iulian Sandu Popa, Karine Zeitouni, Vincent Oria, ...
DAGSTUHL
2001
15 years 3 months ago
An Overview of the GXL Graph Exchange Language
GXL (Graph eXchange Language) is designed to be a standard exchange format for graph-based tools. GXL is defined as an XML sublanguage, which offers support for exchanging instanc...
Andreas Winter, Bernt Kullbach, Volker Riediger