Sciweavers

2693 search results - page 480 / 539
» French Order Without Order
Sort
View
KDD
2000
ACM
149views Data Mining» more  KDD 2000»
13 years 11 months ago
Efficient clustering of high-dimensional data sets with application to reference matching
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
Andrew McCallum, Kamal Nigam, Lyle H. Ungar
CGI
1997
IEEE
13 years 11 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
SOFSEM
2000
Springer
13 years 11 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»
13 years 11 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...
POPL
1995
ACM
13 years 11 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