Sciweavers

11211 search results - page 120 / 2243
» Rank-Sensitive Data Structures
Sort
View
LICS
2002
IEEE
15 years 5 months ago
Separation Logic: A Logic for Shared Mutable Data Structures
In joint work with Peter O’Hearn and others, based on early ideas of Burstall, we have developed an extension of Hoare logic that permits reasoning about low-level imperative pr...
John C. Reynolds
COSIT
1997
Springer
143views GIS» more  COSIT 1997»
15 years 5 months ago
Using Hierarchical Spatial Data Structures for Hierarchical Spatial Reasoning
This paper gives a definition of Hierarchical Spatial Reasoning, which computes increasingly better results in a hierarchical fashion and stops the computation when a result is ac...
Sabine Timpf, Andrew U. Frank
99
Voted
WABI
2005
Springer
15 years 6 months ago
Rotamer-Pair Energy Calculations Using a Trie Data Structure
Abstract. Protein design software places amino acid side chains by precomputing rotamer-pair energies and optimizing rotamer placement. If the software optimizes by rapid stochasti...
Andrew Leaver-Fay, Brian Kuhlman, Jack Snoeyink
ICCS
2007
Springer
15 years 4 months ago
Discovering Latent Structures: Experience with the CoIL Challenge 2000 Data Set
We present a case study to demonstrate the possibility of discovering complex and interesting latent structures using hierarchical latent class (HLC) models. A similar effort was m...
Nevin Lianwen Zhang
97
Voted
ESA
2006
Springer
92views Algorithms» more  ESA 2006»
15 years 4 months ago
Out-of-Order Event Processing in Kinetic Data Structures
We study the problem of designing kinetic data structures (KDS's for short) when event times cannot be computed exactly and events may be processed in a wrong order. In tradi...
Mohammad Ali Abam, Pankaj K. Agarwal, Mark de Berg...