Sciweavers

2180 search results - page 287 / 436
» Algorithms for discovering bucket orders from data
Sort
View
ICVS
2009
Springer
15 years 11 months ago
Visual Registration Method for a Low Cost Robot
Abstract— An autonomous mobile robot must face the correspondence or data association problem in order to carry out tasks like place recognition or unknown environment mapping. I...
David Aldavert, Arnau Ramisa, Ricardo Toledo, Ramo...
SEMWEB
2010
Springer
15 years 2 months ago
Using Reformulation Trees to Optimize Queries over Distributed Heterogeneous Sources
Abstract. In order to effectively and quickly answer queries in environments with distributed RDF/OWL, we present a query optimization algorithm to identify the potentially relevan...
Yingjie Li, Jeff Heflin
SIGMOD
2008
ACM
101views Database» more  SIGMOD 2008»
16 years 4 months ago
Pay-as-you-go user feedback for dataspace systems
A primary challenge to large-scale data integration is creating semantic equivalences between elements from different data sources that correspond to the same real-world entity or...
Shawn R. Jeffery, Michael J. Franklin, Alon Y. Hal...
KDD
2007
ACM
244views Data Mining» more  KDD 2007»
16 years 5 months ago
A Recommender System Based on Local Random Walks and Spectral Methods
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
Zeinab Abbassi, Vahab S. Mirrokni
DEXA
2005
Springer
80views Database» more  DEXA 2005»
15 years 10 months ago
Optimizing I/O Costs of Multi-dimensional Queries Using Bitmap Indices
Bitmap indices are efficient data structures for processing complex, multi-dimensional queries in data warehouse applications and scientific data analysis. For high-cardinality at...
Doron Rotem, Kurt Stockinger, Kesheng Wu