Sciweavers

2962 search results - page 219 / 593
» Optimizing Spatial Data Structures For Static Data
Sort
View
ESA
2000
Springer
73views Algorithms» more  ESA 2000»
15 years 10 months ago
K-D Trees Are Better when Cut on the Longest Side
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...
Matthew Dickerson, Christian A. Duncan, Michael T....
BMCBI
2005
125views more  BMCBI 2005»
15 years 6 months ago
Query3d: a new method for high-throughput analysis of functional residues in protein structures
Background: The identification of local similarities between two protein structures can provide clues of a common function. Many different methods exist for searching for similar ...
Gabriele Ausiello, Allegra Via, Manuela Helmer-Cit...
TAGT
1998
Springer
184views Graph Theory» more  TAGT 1998»
15 years 10 months ago
A Framework for Adding Packages to Graph Transformation Approaches
Graphs are a commonly used formalism for modeling many different kinds of static and dynamic data. In many applications, data modeling can be improved by using hierarchically struc...
Giorgio Busatto, Gregor Engels, Katharina Mehner, ...
ECCV
2004
Springer
16 years 8 months ago
A Robust Probabilistic Estimation Framework for Parametric Image Models
Models of spatial variation in images are central to a large number of low-level computer vision problems including segmentation, registration, and 3D structure detection. Often, i...
Maneesh Kumar Singh, Himanshu Arora, Narendra Ahuj...
TCOM
2011
170views more  TCOM 2011»
15 years 1 months ago
On Girth Conditioning for Low-Density Parity-Check Codes
—Low-density parity-check (LDPC) codes are gaining interest for high data rate applications in both terrestrial and spatial communications. They can be designed and studied throu...
Samuele Bandi, Velio Tralli, Andrea Conti, Maddale...