Sciweavers

1232 search results - page 85 / 247
» Digraphs: theory, algorithms and applications
Sort
View
DKE
2002
218views more  DKE 2002»
15 years 6 months ago
Computing iceberg concept lattices with T
We introduce the notion of iceberg concept lattices and show their use in knowledge discovery in databases. Iceberg lattices are a conceptual clustering method, which is well suit...
Gerd Stumme, Rafik Taouil, Yves Bastide, Nicolas P...
ATMOS
2010
134views Optimization» more  ATMOS 2010»
15 years 5 months ago
Vertex Disjoint Paths for Dispatching in Railways
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...
Holger Flier, Matús Mihalák, Anita S...
ICCV
2007
IEEE
16 years 8 months ago
The 3D-3D Registration Problem Revisited
We describe a new framework for globally solving the 3D-3D registration problem with unknown point correspondences. This problem is significant as it is frequently encountered in ...
Hongdong Li, Richard I. Hartley
ICPR
2008
IEEE
16 years 7 months ago
Preceding car tracking using belief functions and a particle filter
This article presents a preceding car rear view tracking algorithm which utilizes a particle filter and belief function data fusion. Most of tracking applications resort to only o...
Christèle Lecomte, John Klein, Pierre Mich&...
ICIP
2007
IEEE
16 years 15 days ago
Classification by Cheeger Constant Regularization
This paper develops a classification algorithm in the framework of spectral graph theory where the underlying manifold of a high dimensional data set is described by a graph. The...
Hsun-Hsien Chang, José M. F. Moura