6149 search results - page 1010 / 1230 » Revealing the programming process |
209
click to vote
ICALP
2001
Springer
15 years 10 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
206
Voted
IFIP
2001
Springer
15 years 10 months ago
2001
Springer
This paper presents processing and visualization techniques for Diffusion Tensor Magnetic Resonance Imaging (DT-MRI). In DT-MRI, each voxel is assigned a tensor that describes loc...
209
click to vote
SIGADA
2001
Springer
15 years 10 months ago
2001
Springer
Statement and AbstractProblem Statement and AbstractProblem Statement and AbstractProblem Statement and Abstract The U.S. Navy currently bases the majority of our contact managemen...
209
click to vote
RSP
2000
IEEE
15 years 10 months ago
2000
IEEE
Dataflow programming has proven to be popular for representing applications in rapid prototyping tools for digital signal processing (DSP); however, existing dataflow design tools...
169
Voted
ISPD
2000
ACM
15 years 10 months ago
2000
ACM
modules can be handled in constraint graphs efficiently. This Floorplan area minimization is an important problem because many modules have shape flexibilities during the floorplan...