Sciweavers

1529 search results - page 61 / 306
» Search Space Analysis of the Linear Ordering Problem
Sort
View
134
Voted
ICDT
2001
ACM
116views Database» more  ICDT 2001»
15 years 8 months ago
On Optimizing Nearest Neighbor Queries in High-Dimensional Data Spaces
Abstract. Nearest-neighbor queries in high-dimensional space are of high importance in various applications, especially in content-based indexing of multimedia data. For an optimiz...
Stefan Berchtold, Christian Böhm, Daniel A. K...
146
Voted
CIKM
2008
Springer
15 years 5 months ago
On low dimensional random projections and similarity search
Random projection (RP) is a common technique for dimensionality reduction under L2 norm for which many significant space embedding results have been demonstrated. However, many si...
Yu-En Lu, Pietro Liò, Steven Hand
162
Voted
DMDW
2000
173views Management» more  DMDW 2000»
15 years 5 months ago
A quality-based framework for physical data warehouse design
Data warehousing is a software infrastructure which supports OLAP applications by providing a collection of tools which allow data extraction and cleaning, data integration and ag...
Mokrane Bouzeghoub, Zoubida Kedad
118
Voted
ICFEM
2009
Springer
15 years 10 months ago
Scalable Multi-core Model Checking Fairness Enhanced Systems
Rapid development in hardware industry has brought the prevalence of multi-core systems with shared-memory, which enabled the speedup of various tasks by using parallel algorithms....
Yang Liu 0003, Jun Sun 0001, Jin Song Dong
147
Voted
CVPR
2010
IEEE
15 years 11 months ago
Dense Non-rigid Surface Registration Using High-Order Graph Matching
In this paper, we propose a high-order graph matching formulation to address non-rigid surface matching. The singleton terms capture the geometric and appearance similarities (e.g...
Yun Zeng, Chaohui Wang, Yang Wang, Xianfeng Gu, Di...