Sciweavers

4037 search results - page 751 / 808
» Routing without ordering
Sort
View
CGI
1997
IEEE
15 years 6 months ago
An Algorithm for Polygon Subdivision Based on Vertex Normals
In order to achieve the impression of a smooth surface while rendering a polygon mesh, normal vector vectors may be provided in the vertices of the mesh that are the average of th...
Cornelius W. A. M. van Overveld, Brian Wyvill
137
Voted
SOFSEM
2000
Springer
15 years 6 months ago
Exhaustive Search, Combinatorial Optimization and Enumeration: Exploring the Potential of Raw Computing Power
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
Jürg Nievergelt
VLDB
2000
ACM
133views Database» more  VLDB 2000»
15 years 6 months ago
Memex: A Browsing Assistant for Collaborative Archiving and Mining of Surf Trails
Keyword indices, topic directories, and link-based rankings are used to search and structure the rapidly growing Web today. Surprisingly little use is made of years of browsing ex...
Soumen Chakrabarti, Sandeep Srivastava, Mallela Su...
124
Voted
POPL
1995
ACM
15 years 5 months ago
Compiling Polymorphism Using Intensional Type Analysis
Traditional techniques for implementing polymorphism use a universal representation for objects of unknown type. Often, this forces a compiler to use universal representations eve...
Robert Harper, J. Gregory Morrisett
STOC
1991
ACM
84views Algorithms» more  STOC 1991»
15 years 5 months ago
Self-Testing/Correcting for Polynomials and for Approximate Functions
The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-te...
Peter Gemmell, Richard J. Lipton, Ronitt Rubinfeld...