Sciweavers

157 search results - page 28 / 32
» Compact representations of separable graphs
Sort
View
AI
2010
Springer
13 years 7 months ago
Kernel functions for case-based planning
Case-based planning can take advantage of former problem-solving experiences by storing in a plan library previously generated plans that can be reused to solve similar planning p...
Ivan Serina
PLDI
2004
ACM
14 years 23 days ago
Symbolic pointer analysis revisited
Pointer analysis is a critical problem in optimizing compiler, parallelizing compiler, software engineering and most recently, hardware synthesis. While recent efforts have sugges...
Jianwen Zhu, Silvian Calman
CIKM
2007
Springer
14 years 1 months ago
Regularized locality preserving indexing via spectral regression
We consider the problem of document indexing and representation. Recently, Locality Preserving Indexing (LPI) was proposed for learning a compact document subspace. Different from...
Deng Cai, Xiaofei He, Wei Vivian Zhang, Jiawei Han
KDD
2008
ACM
246views Data Mining» more  KDD 2008»
14 years 7 months ago
Direct mining of discriminative and essential frequent patterns via model-based search tree
Frequent patterns provide solutions to datasets that do not have well-structured feature vectors. However, frequent pattern mining is non-trivial since the number of unique patter...
Wei Fan, Kun Zhang, Hong Cheng, Jing Gao, Xifeng Y...
ECCV
1998
Springer
14 years 9 months ago
From Reference Frames to Reference Planes: Multi-View Parallax Geometry and Applications
Abstract. This paper presents a new framework for analyzing the geometry of multiple 3D scene points from multiple uncalibrated images, based on decomposing the projection of these...
Michal Irani, P. Anandan, Daphna Weinshall