157 search results - page 28 / 32 » Compact representations of separable graphs |
140
Voted
AI
2010
Springer
15 years 2 months ago
2010
Springer
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...
132
click to vote
PLDI
2004
ACM
15 years 7 months ago
2004
ACM
Pointer analysis is a critical problem in optimizing compiler, parallelizing compiler, software engineering and most recently, hardware synthesis. While recent efforts have sugges...
139
Voted
CIKM
2007
Springer
15 years 8 months ago
2007
Springer
We consider the problem of document indexing and representation. Recently, Locality Preserving Indexing (LPI) was proposed for learning a compact document subspace. Different from...
125
click to vote
KDD
2008
ACM
16 years 2 months ago
2008
ACM
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...
162
Voted
ECCV
1998
Springer
16 years 4 months ago
1998
Springer
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...