Sciweavers

594 search results - page 55 / 119
» A Note on Concepts and Distances
Sort
View
EPIA
2009
Springer
14 years 2 months ago
An Algorithm to Discover the k-Clique Cover in Networks
Abstract. In social network analysis, a k-clique is a relaxed clique, i.e., a kclique is a quasi-complete sub-graph. A k-clique in a graph is a sub-graph where the distance between...
Luís Cavique, Armando B. Mendes, Jorge M. A...
ICPR
2008
IEEE
14 years 2 months ago
A novel validity measure for clusters of arbitrary shapes and densities
Several validity indices have been designed to evaluate solutions obtained by clustering algorithms. Traditional indices are generally designed to evaluate center-based clustering...
Noha A. Yousri, Mohamed S. Kamel, Mohamed A. Ismai...
AIED
2005
Springer
14 years 1 months ago
Interactive Authoring Support for Adaptive Educational Systems
A well-known challenge of adaptive educational systems is the need to develop intelligent content, which is very time and expertise consuming. In traditional approaches a teacher i...
Peter Brusilovsky, Sergey A. Sosnovsky, Michael Yu...
HUC
2003
Springer
14 years 1 months ago
Activity Zones for Context-Aware Computing
Location is a primary cue in many context-aware computing systems, and is often represented as a global coordinate, room number, or a set of Euclidean distances to various landmark...
Kimberle Koile, Konrad Tollmar, David Demirdjian, ...
AVBPA
2001
Springer
116views Biometrics» more  AVBPA 2001»
13 years 11 months ago
Face Identification and Verification via ECOC
We propose a novel approach to face identification and verification based on the Error Correcting Output Coding (ECOC) classifier design concept. In the training phase the client s...
Josef Kittler, Reza Ghaderi, Terry Windeatt, Jiri ...