Sciweavers

109 search results - page 19 / 22
» Optimization Using Tuple Subsumption
Sort
View
JMM2
2007
127views more  JMM2 2007»
13 years 7 months ago
Robust Face Recognition through Local Graph Matching
— A novel face recognition method is proposed, in which face images are represented by a set of local labeled graphs, each containing information about the appearance and geometr...
Ehsan Fazl Ersi, John S. Zelek, John K. Tsotsos
ICDE
2003
IEEE
148views Database» more  ICDE 2003»
14 years 8 months ago
Efficient Computation of Subqueries in Complex OLAP
Expressing complex OLAP queries using group-by, aggregation, and joins can be extremely difficult. As a result of this, many alternate ways of expressing such queries have been de...
Michael H. Böhlen, Michael O. Akinde
EDBT
2006
ACM
105views Database» more  EDBT 2006»
14 years 7 months ago
HASE: A Hybrid Approach to Selectivity Estimation for Conjunctive Predicates
Current methods for selectivity estimation fall into two broad categories, synopsis-based and sampling-based. Synopsis-based methods, such as histograms, incur minimal overhead at ...
Xiaohui Yu, Nick Koudas, Calisto Zuzarte
GECCO
2006
Springer
164views Optimization» more  GECCO 2006»
13 years 11 months ago
Biobjective evolutionary and heuristic algorithms for intersection of geometric graphs
Wire routing in a VLSI chip often requires minimization of wire-length as well as the number of intersections among multiple nets. Such an optimization problem is computationally ...
Rajeev Kumar, Pramod Kumar Singh, Bhargab B. Bhatt...
EDBT
2004
ACM
147views Database» more  EDBT 2004»
14 years 7 months ago
Projection Pushing Revisited
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
Benjamin J. McMahan, Guoqiang Pan, Patrick Porter,...