Sciweavers

1951 search results - page 41 / 391
» An algorithm for improving graph partitions
Sort
View
CVPR
2007
IEEE
16 years 12 hour ago
A Novel Approach to Improve Biometric Recognition Using Rank Level Fusion
This paper proposes a novel approach for rank level fusion which gives improved performance gain verified by experimental results. In the absence of ranked features and instead of...
Jay Bhatnagar, Ajay Kumar, Nipun Saggar
PRDC
2006
IEEE
15 years 4 months ago
Fault-Tolerant Partitioning Scheduling Algorithms in Real-Time Multiprocessor Systems
This paper presents the performance analysis of several well-known partitioning scheduling algorithms in real-time and fault-tolerant multiprocessor systems. Both static and dynam...
Hakem Beitollahi, Geert Deconinck
CAIP
2005
Springer
114views Image Analysis» more  CAIP 2005»
15 years 3 months ago
A Segmentation Algorithm for Noisy Images
This paper presents a segmentation algorithm for gray-level images and addresses issues related to its performance on noisy images. It formulates an image segmentation problem as a...
Soufiane Rital, Hocine Cherifi, Serge Miguet
MP
1998
117views more  MP 1998»
14 years 9 months ago
The node capacitated graph partitioning problem: A computational study
In this paper we consider the problem of ^-partitioning the nodes of a graph with capacity restrictions on the sum of the node weights in each subset of the partition, and the obje...
Carlos Eduardo Ferreira, Alexander Martin, C. Carv...
PAMI
2006
141views more  PAMI 2006»
14 years 10 months ago
Diffusion Maps and Coarse-Graining: A Unified Framework for Dimensionality Reduction, Graph Partitioning, and Data Set Parameter
We provide evidence that non-linear dimensionality reduction, clustering and data set parameterization can be solved within one and the same framework. The main idea is to define ...
Stéphane Lafon, Ann B. Lee