Sciweavers

2745 search results - page 83 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
110
Voted
IMR
2004
Springer
15 years 9 months ago
Entkerner: A System for Removal of Globally Invisible Triangles from Large Meshes
We present a method that computes a global potentially visible set for the complete region outside the convex hull of an object. The technique is used to remove invisible parts (t...
Manfred Ernst, Frank Firsching, Roberto Grosso
SODA
2003
ACM
131views Algorithms» more  SODA 2003»
15 years 4 months ago
Root comparison techniques applied to computing the additively weighted Voronoi diagram
This work examines algebraic techniques for comparing quadratic algebraic numbers, thus yielding methods for deciding key predicates in various geometric constructions. Our motiva...
Menelaos I. Karavelas, Ioannis Z. Emiris
156
Voted
ACL
2008
15 years 5 months ago
Pairwise Document Similarity in Large Collections with MapReduce
This paper presents a MapReduce algorithm for computing pairwise document similarity in large document collections. MapReduce is an attractive framework because it allows us to de...
Tamer Elsayed, Jimmy J. Lin, Douglas W. Oard
145
Voted
GD
1995
Springer
15 years 7 months ago
Fast Interactive 3-D Graph Visualization
We present a 3-D version of GEM [6], a randomized adaptive layout algorithm for nicely drawing undirected graphs, based on the spring-embedder paradigm [4]. The new version, GEM-3D...
Ingo Bruß, Arne Frick
ICML
2003
IEEE
16 years 4 months ago
SimpleSVM
We present a fast iterative support vector training algorithm for a large variety of different formulations. It works by incrementally changing a candidate support vector set usin...
S. V. N. Vishwanathan, Alex J. Smola, M. Narasimha...