Sciweavers

4095 search results - page 680 / 819
» How to test a tree
Sort
View
COMPGEOM
1995
ACM
13 years 11 months ago
A Comparison of Sequential Delaunay Triangulation Algorithms
This paper presents an experimental comparison of a number of different algorithms for computing the Deluanay triangulation. The algorithms examined are: Dwyer’s divide and conq...
Peter Su, Robert L. (Scot) Drysdale III
SI3D
1995
ACM
13 years 11 months ago
The Sort-First Rendering Architecture for High-Performance Graphics
Interactive graphics applications have long been challenging graphics system designers by demanding machines that can provide ever increasing polygon rendering performance. Anothe...
Carl Mueller
SIGIR
1995
ACM
13 years 11 months ago
Probability Kinematics in Information Retrieval
We analyse the kinematics of probabilistic term weights at retrieval time for di erent Information Retrieval models. We present four models based on di erent notions of probabilis...
Fabio Crestani, C. J. van Rijsbergen
CIARP
2009
Springer
13 years 11 months ago
A Brief Index for Proximity Searching
A large number of computer tasks can be modeled as the search for an object near a given query. From multimedia databases to learning algorithms, data mining and pattern recognitio...
Eric Sadit Tellez, Edgar Chávez, Antonio Ca...
AAAI
2008
13 years 10 months ago
Transfer Learning via Dimensionality Reduction
Transfer learning addresses the problem of how to utilize plenty of labeled data in a source domain to solve related but different problems in a target domain, even when the train...
Sinno Jialin Pan, James T. Kwok, Qiang Yang