Sciweavers

51 search results - page 10 / 11
» Optimizing relational store for e-catalog queries: a data mi...
Sort
View
NECO
2000
86views more  NECO 2000»
13 years 6 months ago
A Bayesian Committee Machine
The Bayesian committee machine (BCM) is a novel approach to combining estimators which were trained on different data sets. Although the BCM can be applied to the combination of a...
Volker Tresp
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
13 years 11 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
SSD
2007
Springer
133views Database» more  SSD 2007»
14 years 16 days ago
Compression of Digital Road Networks
Abstract. In the consumer market, there has been an increasing interest in portable navigation systems in the last few years. These systems usually work on digital map databases st...
Jonghyun Suh, Sungwon Jung, Martin Pfeifle, Khoa T...
VLDB
2004
ACM
163views Database» more  VLDB 2004»
13 years 11 months ago
Compressing Large Boolean Matrices using Reordering Techniques
Large boolean matrices are a basic representational unit in a variety of applications, with some notable examples being interactive visualization systems, mining large graph struc...
David S. Johnson, Shankar Krishnan, Jatin Chhugani...
DAIS
2006
13 years 7 months ago
PAGE: A Distributed Infrastructure for Fostering RDF-Based Interoperability
This paper shows how to build a scalable, robust and efficient distributed Internet-scale RDF repository, that we name PAGE (Put And Get Everywhere). 1 Motivation In the recent yea...
Emanuele Della Valle, Andrea Turati, Alessandro Gh...