Sciweavers

6608 search results - page 1282 / 1322
» On the Completeness of Model Checking
Sort
View
143
Voted
ICALP
2004
Springer
15 years 8 months ago
The Black-Box Complexity of Nearest Neighbor Search
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
Robert Krauthgamer, James R. Lee
99
Voted
ICCS
2004
Springer
15 years 8 months ago
A Framework for Online Inversion-Based 3D Site Characterization
Our goal is to develop the capability for characterizing the three-dimensional geological structure and mechanical properties of individual sites and complete basins in earthquake-...
Volkan Akcelik, Jacobo Bielak, George Biros, Ioann...
107
Voted
ICCS
2004
Springer
15 years 8 months ago
Computational Engineering and Science Program at the University of Utah
We summarize the Computational Engineering and Science program at the University of Utah. Program requirements as well as related research areas are outlined. To obtain the MS degr...
Carleton DeTar, Aaron L. Fogelson, Christopher R. ...
IMR
2004
Springer
15 years 8 months ago
Finite Element Mesh Sizing for Surfaces Using Skeleton
The finite element (FE) mesh sizing has great influence on computational time, memory usage, and accuracy of FE analysis. Based on a systematic in-depth study of the geometric com...
William Roshan Quadros, Steven J. Owen, Michael L....
141
Voted
ISAAC
2004
Springer
112views Algorithms» more  ISAAC 2004»
15 years 8 months ago
Dynamic Tree Cross Products
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
Marcus Raitner
« Prev « First page 1282 / 1322 Last » Next »