Sciweavers

5210 search results - page 681 / 1042
» Exact geometric computation
Sort
View
COMPGEOM
2010
ACM
15 years 9 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
WETICE
1997
IEEE
15 years 8 months ago
Capturing Geometry Rationale for Collaborative Design
When an artifact is designed the typical output consists of documents describing the final result of a long series of deliberations and tradeoffs by the participants of collaborat...
Mark Klein
ICHIM
2001
190views more  ICHIM 2001»
15 years 5 months ago
Chromatic Adaptation Post-Filtering in Image Synthesis Reproduction of Ancient Building for Restoration Support
Within the field of cultural heritage restoration, experts are interested in the analysis of data describing the condition and history of ancient monuments. Data are usually distr...
Maurizio Rossi, Daniele Marini, Alessandro Rizzi
NIPS
2001
15 years 5 months ago
K-Local Hyperplane and Convex Distance Nearest Neighbor Algorithms
Guided by an initial idea of building a complex (non linear) decision surface with maximal local margin in input space, we give a possible geometrical intuition as to why K-Neares...
Pascal Vincent, Yoshua Bengio
AAAI
2000
15 years 5 months ago
Recognizing End-User Transactions in Performance Management
Providing good quality of service (e.g., low response times) in distributed computer systems requires measuring enduser perceptions of performance. Unfortunately, such measures ar...
Joseph L. Hellerstein, T. S. Jayram, Irina Rish