Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Charles J. Turner

dblp:23/6448 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1994
—ORCID · unresolved

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 first-authorComputer networks · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 75% High-performance computing · 25%
Computer networks
1 paper
Transport protocols and congestion control · 67% Content delivery and video streaming · 33%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Environmental and earth informatics · 100%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Parallel and multicore computing
data parallelism
0.011994
Adaptive data parallel methods for ecosystem monitoring · SC 1994
Parallel and multicore computing › data parallelism
nested data parallelism
0.011994
Adaptive data parallel methods for ecosystem monitoring · SC 1994
Parallel and multicore computing
parallel programming models
0.011994
Adaptive data parallel methods for ecosystem monitoring · SC 1994
High-performance computing
scientific computing systems
0.011994
Adaptive data parallel methods for ecosystem monitoring · SC 1994
Content delivery and video streaming › content sharing
image sharing
0.011992
Image Transfer: An End-to-End Design · SIGCOMM 1992
Transport protocols and congestion control › transport protocols
image transport protocol
0.011992
Image Transfer: An End-to-End Design · SIGCOMM 1992
Transport protocols and congestion control
transport protocols
0.011992
Image Transfer: An End-to-End Design · SIGCOMM 1992
Environmental and earth informatics
ecological monitoring
0.011994
Adaptive data parallel methods for ecosystem monitoring · SC 1994

Methods — techniques the papers use, named apart from their topics

feature extraction · 0.0coarse-to-fine processing · 0.0spatial transformations · 0.0spatial transformation · 0.0
YearPublicationVenuePosition
1994 Adaptive data parallel methods for ecosystem monitoring
abstract
Biological diversity is decreasing at an alarming rate worldwide. Improved ecosystem monitoring can help detect problems in time to intervene. Earth orbiting satellites collecting terabytes of imagery daily, can support effective monitoring of many habitats. Data parallelism is ideal for many automated image analysis algorithms, but less natural for the complex spatial structure of most ecosystems. This paper presents a coarse-to-fine processing framework: based on a set of spatial transformations, that compact disconnected regions to achieve more efficient nested data parallelism. Experiments with a montane island ecosystem in southeast Arizona use Landsat TM data to characterize the processing framework the spatial transformations, and the feature extraction algorithms.>
Charles J. Turner, Jennifer G. Turner
SC1
1992 Image Transfer: An End-to-End Design
abstract
The transfer of digital images between data archives and scientific workstations is likely to consume a significant amount of network bandwidth in the very near future. This paper examines the image transfer problem from an end-to-end perspective, that is, it describes a complete image transfer protocol that takes into account both the nature of digital imagery and the properties of the underlying network. Specifically, it describes a simple algorithm for encoding images into network packets in such a way that the receiver can recover from dropped packets without requiring the sender to retransmit them. Avoiding retransmissions has the advantages of improving response time and eliminating the need to buffer data at the sender.
Charles J. Turner, Larry L. Peterson
SIGCOMM1