Sciweavers

2635 search results - page 73 / 527
» Algorithms for the Database Layout Problem
Sort
View
WEA
2007
Springer
112views Algorithms» more  WEA 2007»
15 years 10 months ago
Crossing Minimization in Weighted Bipartite Graphs
Given a bipartite graph G = (L0, L1, E) and a fixed ordering of the nodes in L0, the problem of finding an ordering of the nodes in L1 that minimizes the number of crossings has ...
Olca A. Çakiroglu, Cesim Erten, Ömer K...
211
Voted
SIGMOD
2005
ACM
107views Database» more  SIGMOD 2005»
16 years 4 months ago
Relational Confidence Bounds Are Easy With The Bootstrap
Statistical estimation and approximate query processing have become increasingly prevalent applications for database systems. However, approximation is usually of little use witho...
Abhijit Pol, Chris Jermaine
115
Voted
DAWAK
1999
Springer
15 years 8 months ago
Heuristic Algorithms for Designing a Data Warehouse with SPJ Views
A Data Warehouse DW can be abstractly seen as a set of materialized views de ned over relations that are stored in distributed heterogeneous databases. The selection of views for...
Spyros Ligoudistianos, Timos K. Sellis, Dimitri Th...
134
Voted
CAIP
2009
Springer
246views Image Analysis» more  CAIP 2009»
15 years 10 months ago
Human Age Estimation by Metric Learning for Regression Problems
Abstract. The estimation of human age from face images is an interesting problem in computer vision. We proposed a general distance metric learning scheme for regression problems, ...
Yangjing Long
SDM
2007
SIAM
145views Data Mining» more  SDM 2007»
15 years 5 months ago
Finding Motifs in a Database of Shapes
The problem of efficiently finding images that are similar to a target image has attracted much attention in the image processing community and is rightly considered an informatio...
Xiaopeng Xi, Eamonn J. Keogh, Li Wei, Agenor Mafra...