Skip navigation
Statistics
Help
About OPUS
How to Deposit
Managing Copyright
Browse
UTS Organisational Groups
Browse Items by:
Issue Date
Author
Title
Type
ARC/NHRMC Funded
Search OPUS
OPUS at UTS
Browsing byAuthorOuyang, D
Jump to:
0-9
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
or enter first few letters:
Sort by:
title
issue date
submit date
ARC/NHRMC funded
In order:
Ascending
Descending
Results/Page
5
10
15
20
25
30
35
40
45
50
55
60
65
70
75
80
85
90
95
100
Authors/Record:
All
1
5
10
15
20
25
30
35
40
45
50
Showing results 5 to 12 of 12
< previous
Issue Date
Title
Author(s)
2003-01-01
A logic framework with algebraic extension
Cheng, X
;
Ouyang, D
;
Zhang, C
2020-06-14
Progressive Top-K Nearest Neighbors Search in Large Road Networks
Ouyang, D
;
Wen, D
;
Qin, L
;
Chang, L
;
Zhang, Y
;
Lin, X
;
Maier, D
;
Pottinger, R
;
Doan, A
;
Tan, W-C
;
Alawini, A
;
Ngo, HQ
2020-05-27
Speeding Up GED Verification for Graph Similarity Search
Chang, L
;
Feng, X
;
Lin, X
;
Qin, L
;
Zhang, W
;
Ouyang, D
2023-05-01
Sum-based event-triggered dynamic output feedback control for synchronization of fuzzy neural networks with deception attacks
Zhang, D
;
Ouyang, D
;
Shu, L
;
Hu, C
;
Shi, K
;
Wen, S
2018-01-01
Towards efficient path skyline computation in bicriteria networks
Ouyang, D
;
Yuan, L
;
Zhang, F
;
Qin, L
;
Lin, X
2018-10-15
Video-based person re-identification via self-paced learning and deep reinforcement learning framework
Ouyang, D
;
Shao, J
;
Zhang, Y
;
Yang, Y
;
Shen, HT
2023-11-01
When hierarchy meets 2-hop-labeling: efficient shortest distance and path queries on road networks
Ouyang, D
;
Wen, D
;
Qin, L
;
Chang, L
;
Lin, X
;
Zhang, Y
2018-05-27
When Hierarchy meets 2-hop-labeling: Effiicient shortest distance ?eries on road networks
Ouyang, D
;
Qin, L
;
Chang, L
;
Lin, X
;
Zhang, Y
;
Zhu, Q