3958 search results - page 43 / 792 » Dynamic Graph Algorithms with Applications |
130
click to vote
FAW
2010
Springer
15 years 3 months ago
2010
Springer
A d-interval is the union of d disjoint intervals on the real line. A d-track interval is the union of d disjoint intervals on d disjoint parallel lines called tracks, one interval...
111
Voted
MVA
1998
15 years 3 months ago
1998
An efficient matching method for segment-based stereo vision is proposed. A potential matching graph which describes the connectivity between candidate matching pairs of segments ...
115
click to vote
IWPSE
2005
IEEE
15 years 8 months ago
2005
IEEE
The evolution of Web Applications needs to be supported by the availability of proper analysis and design documents. UML use case diagrams are certainly useful to identify feature...
127
Voted
TAICPART
2010
IEEE
15 years 28 days ago
2010
IEEE
Abstract. Writing multithreaded software for multicore computers confronts many developers with the difficulty of finding parallel programming errors. In the past, most parallel d...
94
Voted
ICSE
2003
IEEE-ACM
16 years 2 months ago
2003
IEEE-ACM
Dynamic slicing algorithms can greatly reduce the debugging effort by focusing the attention of the user on a relevant subset of program statements. In this paper we present the d...