MétaCan
Menu
Back to cohort
Record W2127682860 · doi:10.1109/ccece.1993.332256

A fast distance approximation algorithm for encoded quadtree locations

2002· article· en· W2127682860 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicDigital Image Processing Techniques
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsEuclidean distanceFunction (biology)Integer (computer science)Approximation errorAlgorithmComputer sciencePlane (geometry)Euclidean spaceDomain (mathematical analysis)Euclidean geometryApproximation algorithmDistance transformQuadtreeDistance measuresMathematicsDistance measurementCombinatoricsDiscrete mathematicsArtificial intelligenceMathematical analysisImage (mathematics)Geometry

Abstract

fetched live from OpenAlex

Several distance approximation functions to the Euclidean distance of two points in the two-dimensional Euclidean plane are reviewed. An improved distance function is proposed and compared with previous ones as to their maximum relative errors and their execution times. The improved distance function is then applied for distance calculations in the domain of linear quadtrees using dilated integer arithmetic. The maximum relative error is discussed and execution times are reported.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.945
Threshold uncertainty score0.410

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.002
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.026
GPT teacher head0.258
Teacher spread0.233 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Quick stats

Citations3
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicDigital Image Processing TechniquesFrench-language works237,207