Sciweavers

2635 search results - page 420 / 527
» Algorithms for the Database Layout Problem
Sort
View
PPDP
2010
Springer
15 years 2 months ago
Graph queries through datalog optimizations
This paperdescribes the use of a powerful graph query language for querying programs, and a novel combination of transformations for generating efficient implementations of the q...
K. Tuncay Tekle, Michael Gorbovitski, Yanhong A. L...
KDD
2010
ACM
197views Data Mining» more  KDD 2010»
15 years 2 months ago
Semi-supervised feature selection for graph classification
The problem of graph classification has attracted great interest in the last decade. Current research on graph classification assumes the existence of large amounts of labeled tra...
Xiangnan Kong, Philip S. Yu
160
Voted
PPDP
2010
Springer
15 years 2 months ago
Precise complexity analysis for efficient datalog queries
Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting with the facts or top-down starting with the query. For efficiently answe...
K. Tuncay Tekle, Yanhong A. Liu
CIKM
2010
Springer
15 years 1 months ago
Regularization and feature selection for networked features
In the standard formalization of supervised learning problems, a datum is represented as a vector of features without prior knowledge about relationships among features. However, ...
Hongliang Fei, Brian Quanz, Jun Huan
FGR
2011
IEEE
227views Biometrics» more  FGR 2011»
14 years 7 months ago
Warp that smile on your face: Optimal and smooth deformations for face recognition
— In this work, we present novel warping algorithms for full 2D pixel-grid deformations for face recognition. Due to high variation in face appearance, face recognition is consid...
Tobias Gass, Leonid Pishchulin, Philippe Dreuw, He...