Sciweavers

9849 search results - page 110 / 1970
» Algorithms and Experiments for the Webgraph
Sort
View
AIR
2010
97views more  AIR 2010»
15 years 4 months ago
A unified framework for improving the accuracy of all holistic face identification algorithms
Abstract Reconstructing the challenging human face identification process as a stability problem, we show that Electoral College can be used as a framework that provides a signific...
Liang Chen, Naoyuki Tokuda
DAM
2008
134views more  DAM 2008»
15 years 4 months ago
Efficient algorithms for finding critical subgraphs
This paper presents algorithms to find vertex-critical and edgecritical subgraphs in a given graph G, and demonstrates how these critical subgraphs can be used to determine the ch...
Christian Desrosiers, Philippe Galinier, Alain Her...
IAJIT
2008
223views more  IAJIT 2008»
15 years 4 months ago
A New Exam Scheduling Algorithm Using Graph Coloring
: This paper presents a graph-coloring-based algorithm for the exam scheduling application, with the objective of achieving fairness, accuracy, and optimal exam time period. Throug...
Mohammad Malkawi, Mohammad Al-Haj Hassan, Osama Al...
JGAA
2007
93views more  JGAA 2007»
15 years 4 months ago
Large-Graph Layout Algorithms at Work: An Experimental Study
In the last decade several algorithms that generate straight-line drawings of general large graphs have been invented. In this paper we investigate some of these methods that are ...
Stefan Hachul, Michael Jünger
ICIP
2010
IEEE
15 years 2 months ago
An aliasing detection algorithm based on suspicious colocalizations of Fourier coefficients
We propose a new algorithm to detect the presence and the localization of aliasing in a single digital image.Considering the image in Fourier domain, the fact that two frequencies...
Baptiste Coulange, Lionel Moisan