Sciweavers

943 search results - page 125 / 189
» How should data structures and algorithms be taught
Sort
View
PVLDB
2008
154views more  PVLDB 2008»
13 years 8 months ago
Indexing land surface for efficient kNN query
The class of k Nearest Neighbor (kNN) queries is frequently used in geospatial applications. Many studies focus on processing kNN in Euclidean and road network spaces. Meanwhile, ...
Cyrus Shahabi, Lu-An Tang, Songhua Xing
SIGGRAPH
1993
ACM
14 years 1 months ago
Hierarchical Z-buffer visibility
An ideal visibility algorithm should a) quickly reject most of the hidden geometry in a model and b) exploit the spatial and perhaps temporal coherence of the images being generat...
Ned Greene, Michael Kass, Gavin S. P. Miller
ACISP
1998
Springer
14 years 1 months ago
Detecting Key-Dependencies
The confidentiality of encrypted data depends on how well the key under which it was encrypted is maintained. If a session key was exchanged encrypted under a long-term key, exposu...
Tage Stabell-Kulø, Arne Helme, Gianluca Din...
CANDC
2000
ACM
13 years 9 months ago
Sequence Complexity for Biological Sequence Analysis
A new statistical model for DNA considers a sequence to be a mixture of regions with little structure and regions that are approximate repeats of other subsequences, i.e. instance...
Lloyd Allison, Linda Stern, Timothy Edgoose, Trevo...
CORR
2010
Springer
120views Education» more  CORR 2010»
13 years 4 months ago
LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations
LRM-Trees are an elegant way to partition a sequence of values into sorted consecutive blocks, and to express the relative position of the first element of each block within a prev...
Jérémy Barbay, Johannes Fischer