4037 search results - page 352 / 808 » Routing without ordering |
174
click to vote
ICCV
2005
IEEE
16 years 11 days ago
2005
IEEE
This study addresses the problem of unsupervised visual learning. It examines existing popular model order selection criteria before proposes two novel criteria for improving visu...
163
click to vote
SIGMETRICS
2004
ACM
16 years 5 days ago
2004
ACM
Binary search tree (BST) based data structures, such as AVL trees, red-black trees, and splay trees, are often used in system software, such as operating system kernels. Choosing ...
187
click to vote
RTA
2004
Springer
16 years 3 days ago
2004
Springer
Restrictions of rewriting can eventually achieve termination by pruning all infinite rewrite sequences issued from every term. Contextsensitive rewriting (CSR) is an example of su...
197
click to vote
HIPEAC
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. In transactional memory, aborted transactions reduce performance, and waste computing resources. Ideally, concurrent execution of transactions should be optimally ordered...
174
click to vote
DATE
2000
IEEE
15 years 11 months ago
2000
IEEE
This paper presents a methodology for parallel and distributed simulation of VHDL using the PDES (parallel discrete-event simulation) paradigm. To achieve better features and perf...