Sciweavers

1964 search results - page 194 / 393
» Partitioning Based Algorithms for Some Colouring Problems
Sort
View
MOC
2000
126views more  MOC 2000»
13 years 8 months ago
Adaptive multilevel methods in space and time for parabolic problems-the periodic case
The aim of this paper is to display numerical results that show the interest of some multilevel methods for problems of parabolic type. These schemes are based on multilevel spatia...
J. B. Burie, M. Marion
AAAI
2008
13 years 10 months ago
Clustering via Random Walk Hitting Time on Directed Graphs
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
Mo Chen, Jianzhuang Liu, Xiaoou Tang
DATE
2010
IEEE
139views Hardware» more  DATE 2010»
13 years 11 months ago
Finding reset nondeterminism in RTL designs - scalable X-analysis methodology and case study
Due to increases in design complexity, routing a reset signal to all registers is becoming more difficult. One way to solve this problem is to reset only certain registers and rely...
Hong-Zu Chou, Haiqian Yu, Kai-Hui Chang, Dylan Dob...
ICASSP
2011
IEEE
12 years 12 months ago
Using clustering comparison measures for speaker recognition
Recent results seem to cast some doubt over the assumption that improvements in fused recognition accuracy for speaker recognition systems based on different acoustic features are...
Jia Min Karen Kua, Julien Epps, Mohaddeseh Nosrati...
AAAI
2006
13 years 9 months ago
Focused Real-Time Dynamic Programming for MDPs: Squeezing More Out of a Heuristic
Real-time dynamic programming (RTDP) is a heuristic search algorithm for solving MDPs. We present a modified algorithm called Focused RTDP with several improvements. While RTDP ma...
Trey Smith, Reid G. Simmons