921 search results - page 102 / 185 » New Data Structures for Orthogonal Range Searching |
143
click to vote
3DIM
2005
IEEE
15 years 10 months ago
2005
IEEE
This paper describes how to automatically extract the presence and location of geometrical irregularities on a surface of revolution. To this end a partial 3D scan of the workpiec...
133
click to vote
ICML
1997
IEEE
16 years 5 months ago
1997
IEEE
In recent years there has been a flurry of works on learning probabilistic belief networks. Current state of the art methods have been shown to be successful for two learning scen...
147
click to vote
ALGORITHMICA
2005
15 years 4 months ago
2005
A new priority queue structure, the queap, is introduced. The queap executes insertion in O(1) amortized time and extract-min in O(log(k+2)) amortized time if there are k items th...
139
click to vote
BIS
2008
15 years 5 months ago
2008
Deep web search requires a transformation between search keywords and semantically described and well-formed data structures. We approached this problem in our "In the Web of ...
152
click to vote
IPPS
2005
IEEE
2005
IEEE
Building on a Framework: Using FG for More Flexibility and Improved Performance in Parallel Programs
15 years 10 months ago
We describe new features of FG that are designed to improve performance and extend the range of computations that fit into its framework. FG (short for Framework Generator) is a ...