Sciweavers

165 search results - page 25 / 33
» Comparing Set-Covering Strategies for Optimal Corpus Design
Sort
View
SSPR
2004
Springer
14 years 2 months ago
Combining Classifier for Face Identification at Unknown Views with a Single Model Image
Abstract. We investigate a number of approaches to pose invariant face recognition. Basically, the methods involve three sequential functions for capturing nonlinear manifolds of f...
Tae-Kyun Kim, Josef Kittler
EDBT
1992
ACM
111views Database» more  EDBT 1992»
14 years 16 days ago
Pipelined Query Processing in the DBGraph Storage Model
The DBGraph storage model, designed for main memory DBMS, ensures both data storage compactness and efficient processing for all database operations. By representing the entire da...
Philippe Pucheral, Jean-Marc Thévenin
ATMOS
2010
128views Optimization» more  ATMOS 2010»
13 years 8 months ago
Robust Train Routing and Online Re-scheduling
Train Routing is a problem that arises in the early phase of the passenger railway planning process, usually several months before operating the trains. The main goal is to assign...
Alberto Caprara, Laura Galli, Leo G. Kroon, G&aacu...
GECCO
2006
Springer
215views Optimization» more  GECCO 2006»
14 years 20 days ago
A multi-chromosome approach to standard and embedded cartesian genetic programming
Embedded Cartesian Genetic Programming (ECGP) is an extension of Cartesian Genetic Programming (CGP) that can automatically acquire, evolve and re-use partial solutions in the for...
James Alfred Walker, Julian Francis Miller, Rachel...
MOBIHOC
2005
ACM
14 years 8 months ago
Efficient geographic routing in multihop wireless networks
We propose a new link metric called normalized advance (NADV) for geographic routing in multihop wireless networks. NADV selects neighbors with the optimal trade-off between proxi...
Seungjoon Lee, Bobby Bhattacharjee, Suman Banerjee