Sciweavers

2489 search results - page 358 / 498
» On the Subgroup Distance Problem
Sort
View
IJIPT
2008
191views more  IJIPT 2008»
15 years 3 months ago
ARPM: Agent-based Routing Protocol for MANET
Mobile ad-hoc networks (MANETs) are infrastructure-less networks where no central network management exists, composed of mobile nodes over wireless links. Network topology in MANE...
Helen Bakhsh, Manal Abdullah
CORR
2007
Springer
110views Education» more  CORR 2007»
15 years 3 months ago
On formulas for decoding binary cyclic codes
— We address the problem of the algebraic decoding of any cyclic code up to the true minimum distance. For this, we use the classical formulation of the problem, which is to fin...
Daniel Augot, Magali Bardet, Jean-Charles Faug&egr...
PAMI
2008
391views more  PAMI 2008»
15 years 3 months ago
Riemannian Manifold Learning
Recently, manifold learning has been widely exploited in pattern recognition, data analysis, and machine learning. This paper presents a novel framework, called Riemannian manifold...
Tong Lin, Hongbin Zha
IJAR
2007
90views more  IJAR 2007»
15 years 3 months ago
An argumentation framework for merging conflicting knowledge bases
The problem of merging multiple sources of information is central in many information processing areas such as databases integrating problems, multiple criteria decision making, e...
Leila Amgoud, Souhila Kaci
154
Voted
SIAMJO
2008
144views more  SIAMJO 2008»
15 years 3 months ago
Embedded in the Shadow of the Separator
Eigenvectors to the second smallest eigenvalue of the Laplace matrix of a graph, also known as Fiedler vectors, are the basic ingredient in spectral graph partitioning heuristics....
Frank Göring, Christoph Helmberg, Markus Wapp...