Sciweavers

921 search results - page 94 / 185
» New Data Structures for Orthogonal Range Searching
Sort
View
CGF
2006
155views more  CGF 2006»
15 years 4 months ago
Opacity Peeling for Direct Volume Rendering
The most important technique to visualize 3D scalar data, as they arise e.g. in medicine from tomographic measurement, is direct volume rendering. A transfer function maps the sca...
Christof Rezk-Salama, Andreas Kolb
NAR
2000
103views more  NAR 2000»
15 years 4 months ago
The Homeodomain Resource: a prototype database for a large protein family
The Homeodomain Resource is an annotated collection of non-redundant protein sequences, three-dimensional structures and genomic information for the homeodomain protein family. Re...
Sharmila Banerjee-Basu, Joseph F. Ryan, Andreas D....
ICPP
2007
IEEE
15 years 10 months ago
Improving Search Using a Fault-Tolerant Overlay in Unstructured P2P Systems
Gnutella overlays have evolved to use a two-tier topology. However, we observed that the new topology had only achieved modest improvements in search success rates. Also, the new ...
William Acosta, Surendar Chandra
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
15 years 9 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
SDM
2004
SIAM
141views Data Mining» more  SDM 2004»
15 years 5 months ago
Visually Mining through Cluster Hierarchies
Similarity search in database systems is becoming an increasingly important task in modern application domains such as multimedia, molecular biology, medical imaging, computer aid...
Stefan Brecheisen, Hans-Peter Kriegel, Peer Kr&oum...