Sciweavers

2799 search results - page 550 / 560
» computing 1998
Sort
View
COCOON
1998
Springer
13 years 12 months ago
The Colored Sector Search Tree: A Dynamic Data Structure for Efficient High Dimensional Nearest-Foreign-Neighbor Queries
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
Thomas Graf, V. Kamakoti, N. S. Janaki Latha, C. P...
COBUILD
1998
Springer
13 years 11 months ago
An Agent-Based Telecooperation Framework
Abstract. As the amount of information and communication increases dramatically new working environments must provide efficient mechanisms to maximize the benefits of these develop...
Albrecht Schmidt, Alexander Specker, Gerhard Parts...
ESA
1998
Springer
162views Algorithms» more  ESA 1998»
13 years 11 months ago
External Memory Algorithms
Abstract. Data sets in large applications are often too massive to t completely inside the computer's internal memory. The resulting input output communication or I O between ...
Jeffrey Scott Vitter
DAGSTUHL
2010
13 years 9 months ago
Patient-Specific Mappings between Myocardial and Coronary Anatomy
The segmentation of the myocardium based on the 17-segment model as recommended by the American Heart Association is widely used in medical practice. The patient-specific coronary...
Maurice Termeer, Javier Oliván Bescó...
CSC
2008
13 years 9 months ago
The Dirichlet problem for the Laplace equation in a starlike domain
Many applications of Mathematical Physics and Engineering are connected with the Laplacian, however, the most part of BVP relevant to the Laplacian are solved in explicit form onl...
Diego Caratelli, Paolo Emilio Ricci