1105 search results - page 58 / 221 » Linear choosability of graphs |
103
click to vote
MCU
2004
15 years 1 months ago
2004
We propose linear time solutions to two much celebrated NP-complete problems, namely the 3CNF-SAT and the directed Hamiltonian Path Problem (HPP), based on AHNEPs having all resour...
COR
2008
14 years 12 months ago
2008
In this paper, an improved Two-Stage Simulated Annealing algorithm is presented for the Minimum Linear Arrangement Problem for Graphs. This algorithm integrates several distinguis...
100
click to vote
ICASSP
2010
IEEE
15 years 2 days ago
2010
IEEE
We present a novel discriminative training algorithm for n-gram language models for use in large vocabulary continuous speech recognition. The algorithm uses large margin estimati...
145
click to vote
JMLR
2010
14 years 6 months ago
2010
We study the problem of image denoising where images are assumed to be samples from low dimensional (sub)manifolds. We propose the algorithm of locally linear denoising. The algor...
124
click to vote
CRV
2005
IEEE
15 years 5 months ago
2005
IEEE
We present an approach to recognizing faces with varying appearances which also considers the relative probability of occurrence for each appearance. We propose and demonstrate ex...